Alternatives

Products that do what Coderive – Iterating through 1 Quintillion Inside a Loop in just 50ms does

Author: Danison Nuñez Project: Coderive Project Type: Programming Language Highlight: Formula-based Execution ## Coderive - Iterating Through 1 Quintillion in a Loop *Subtitle: How a phone interpreter achieves what supercomputers cannot* The Impossible Loop: ```java // In any other language, this would be computational suicide for i in [0 to 1Qi] { // 1,000,000,000,000,000,000 iterations arr[i] = i * i } ``` Traditional Reality: · Python: MemoryError at array creation · Java/C++: Theoretical 31 years (with 8 exabytes of RAM) · NumPy/TensorFlow: Immediate crash ·…

1AD
A dead code killer for Erlang▲103
2021 · tech.nextroll.com
2IP
Integer Programming in the Browser▲52
2017 · strandmark.net
3SA
SuperString – A fast and memory-optimized string library for C++▲52
2018 · github.com
4AN
A nibble-oriented CPU in Verilog to build a scientific calculator▲119
The core question: how did HP's scientific calculators actually work at the gate level? That rabbit hole led to building one from scratch. The architectural decision everything else follows from: a decimal calculator should store numbers as BCD — one decimal digit per 4-bit nibble. A standard byte-oriented CPU (Z80, 6502) fights that layout constantly. So I designed a small custom CPU in Verilog where 4 bits is the natural data width and memory is nibble addressable. What the project covers: - Custom CPU: Harvard architecture, 12-bit ISA, 8-state execution FSM, hardware stack guard with a…
May 2026 · github.com
5UT
Ultra Tiny Compiler in less than 90 lines of code▲61
2016 · github.com
6TS
Teleport: Simple command line app tutorial written in Haskell▲76
2016 · bollu.github.io
7IW
I wrote a maze traversal program in Clojure▲91
2019 · github.com
8SM
Serializable Math Expressions Using Cap'n Proto▲15
2015 · github.com
9AS
A set of handy tools to work with sequences and collections in Python▲29
2013 · github.com
10FF
FFTN, faster than FFTW in 700 lines of C▲7
I am playing around with using arrays of arbitrary dimension as framework for designing FFT implementations, as opposed to the more classical approach of tensor products and butterflies (too complicated in my opinion). It turns out, that with a modern compiler, you do not need much complexity to make a really fast implementation. This implementation is for powers of 2, and optimized for arrays that do not fit in cache. I do think it would be better to use a higher-level language to implement other cases (e.g. n = 2^a * 3^b * 5^c, multiple small FFTs, higher-dimensional), so I am currently…
Oct 2025 · gitlab.sac-home.org
11CJ
Combinatorics.js – Combinatorics JavaScript Library▲25
2015 · github.com
12HA
Hydra, a code counting program written in Haskell▲5
2024 · github.com
13IE
I embedded 685M public texts in 32 minutes (on 8x A100, Rust, TensorRT)▲7
Quick note on how it works and how I've done my batch embedding engine IgniteMS. The whole thing runs as one process using Rust, reading input, tokenizing, packing batches, keeping the queue full. TensorRT handles inference. Python is only as a wrapper. I built it this way because when you use more than couple of GPUs, the GPUs stop being the problem. CPU cannot feed them fast enough. One A100 can go through batches faster than Python can tokenize and feed, so the GPU just sits there idle waiting for work. Most of my time went into optimizing this. At 8 GPUs that was basically the entire…
Jun 2026 · github.com
14YC
You can program without loop and recursion and×÷- is all you need▲9
2024 · github.com
15IM
I made calling WebAssembly from Python 25x times Faster▲5
I found a serious bottleneck in Python binding of Wasmer and Wasmtime and I found a trick to make 25x faster. Then beat all that using NumPy.
2023 · medium.com
16JT
JavaScript typed arrays data structures for memory intensive tasks▲23
2015 · chethiya.github.io
17TB
TurboPFor – Bringing Fastest Integer Compression Incl. SIMD to Java▲14
2015 · github.com
18FO
Flyable - One of the fastest way to execute Python code▲8
Recently, I saw few Python accelerators getting a lot of attention, and I thought it would be a good time to finally present the project that we will make available to test in the upcoming days. Flyable is an ahead-of-time compiler that takes your Python code, analyses it, and outputs very optimized machine code. Micro-benchmarks show that it produces programs that run between 10-70x time faster than Python. Flyable is certainly one of the fastest and easiest ways to accelerate your Python code. It finally allows Python to compete in the ring of fast and efficient languages without having to…
2020
19LA
LibRapid -- A high performance multi-dimensional array library▲8
tl;dr I'm developing an incredibly fast library for arrays and mathematics, and I've implemented a few new features and made some improvements. I'd love for you to check it out! Links: GitHub: https://github.com/LibRapid/librapid/ Documentation: https://librapid.readthedocs.io/en/latest/ Discord: https://discord.com/invite/cGxTFTgCAC Hey everyone! I am the lead developer of LibRapid (https://github.com/LibRapid/librapid/), a high-performance C++ library for array manipulation and mathematics. I've…
2023
20OS
Open-source SIMD-accelerated math library for C/C++/C#/Java/FORTRAN▲9
2013 · yeppp.info
21CF
Conduit for C++: Lazy Sequences Using the Coroutine TS▲7
2018 · medium.com
22BA
Breaking a meaningless world record: computing Γ(1/4) to 500b digits▲12
2020 · andrewsun.com
23HF
How fast can you read code? (infinite Python practice programs)▲5
2020 · trprt.io
24VA
Vaex – A DataFrame with super strings (up to 1000x speedup)▲11
2019 · towardsdatascience.com

Ranked by how close each launch is in meaning, then by votes. Refine with a description →