Dev tools · alternatives · 2026

24 alternatives to Faking SIMD to Search and Sort Strings 5x Faster

I want to share a really dumb, but very practical project I have packaged this summer, to perform operations on strings much faster. I was using Python to work with a multi-terabyte newline-delimited file. Reading, splitting, and shuffling it was a nightmare. So, I wrapped a trivial hardware-friendly heuristic I've been using for the last few years into a CPython library. The part I enjoyed the most is implementing SIMD behavior without SIMD instructions... Using 64-bit words to work at 8-bit granularity. Unlike conventional SIMD, the code would remain the same for ~~almost~~ any hardware.…

This CPython library accelerates string searching and sorting operations, achieving up to 5x performance improvements for large text processing tasks. Built for developers working with massive text datasets like… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes. Faking SIMD to Search and Sort Strings 5x Faster launched in 2023; newer entries below may have overtaken it.

1
I built a hardware processor that runs Python▲983
Hi everyone, I built PyXL — a hardware processor that executes a custom assembly generated from Python programs, without using a traditional interpreter or virtual machine. It compiles Python -> CPython Bytecode -> Instruction set designed for direct hardware execution. I’m sharing an early benchmark: a GPIO test where PyXL achieves a 480ns round-trip toggle — compared to 14-25 micro seconds on a MicroPython Pyboard - even though PyXL runs at a lower clock (100MHz vs. 168MHz). The design is stack-based, fully pipelined, and preserves Python's dynamic typing without static type restrictions.…
2025 · runpyxl.com · its alternatives →
2
RapidFuzz – A fast string matching library for Python▲134
Rapid fuzzy string matching in Python using various string metrics - rapidfuzz/RapidFuzz
2020 · github.com · its alternatives →
3
GPT‑5.3‑Codex‑Spark▲277
An ultra-fast model for real-time coding in Codex
Feb 2026 · openai.com · its alternatives →
4FS
Fast suffix arrays in Python▲72
2017 · louisabraham.github.io · its alternatives →
5
TurboRLE – Turbo Run Length Encoding using SIMD▲23
TurboRLE-Fastest Run Length Encoding. Contribute to powturbo/Turbo-Run-Length-Encoding development by creating an account on GitHub.
2015 · github.com · its alternatives →
6
A SIMD-accelerated noise library in Rust▲73
SIMD noise library for Rust. Contribute to verpeteren/rust-simd-noise development by creating an account on GitHub.
2018 · github.com · its alternatives →
7
Gsubpy, an interpreter for subset of Python, written in Go▲65
Recently, I write an interpreter for subset of Python using Go. I haven't seen source code of CPython, all is just written according to my understanding of Python so there may be some unusual things. Hope you can play fun with it. Any suggestion is welcome, glad to get some feedback.
2023 · github.com · its alternatives →
8
SuperString – A fast and memory-optimized string library for C++▲52
A fast and memory-optimized string library for C++ - btwael/SuperString
2018 · github.com · its alternatives →
9
A hash array-mapped trie implementation in C▲171
Long-simmering side project that is finally ready to see the light. HAMTs are a cool persistent data structure and implementing one has been a lot of fun. Beyond the code, there is likely some value in the extensive and largely complete implementation docs; basic benchmarks are linked in the README, too. Kind of aiming to be "the libavl for HAMTs". That is obviously a high and aspirational bar but a distinct possibility if it stirs up a little interest and/or contribution. Anyways, it's time for this to go out, collect feedback and maybe even some use outside of toy projects. Let me…
2023 · github.com · its alternatives →
10
Fast C-based HTML 5 parsing for Python▲169
Fast C based HTML 5 parsing for python. Contribute to kovidgoyal/html5-parser development by creating an account on GitHub.
2017 · github.com · its alternatives →
11
SIMD Viterbi Decoder in Rust▲64
I wrote libcorrect in C in 2016 and wanted to revisit it in Rust. Instead of doing just a direct conversion, I went down the rabbit hole of making Rust's std::simd work for me. I ended up with a templated, generic Viterbi decoder for convolutional codes that dispatches the decode at runtime depending on which instruction sets are available. For small rates and orders, the entire decode lives in registers. Larger codes work through memory but take advantage of some acceleration structures. I also spent some time building a tool to find optimal (max d_free) conv codes for a given rate and…
Aug 2026 · github.com · its alternatives →
12
High-speed UTF-8 validation in Rust▲127
SIMD-accelerated UTF-8 validation for Rust. Contribute to rusticstuff/simdutf8 development by creating an account on GitHub.
2021 · github.com · its alternatives →
13
Optimizing LiteLLM with Rust – When Expectations Meet Reality▲27
I've been working on Fast LiteLLM - a Rust acceleration layer for the popular LiteLLM library - and I had some interesting learnings that might resonate with other developers trying to squeeze performance out of existing systems. My assumption was that LiteLLM, being a Python library, would have plenty of low-hanging fruit for optimization. I set out to create a Rust layer using PyO3 to accelerate the performance-critical parts: token counting, routing, rate limiting, and connection pooling. The Approach - Built Rust implementations for token counting using tiktoken-rs - Added lock-free data…
Nov 2025 · github.com · its alternatives →
14
A WYSIWYG word processor in Python▲91
Hi all, Finding a good data structure for a word processor is a difficult problem. My notebook diaries on the problem go back 25 years when I was frustrated with using Word for my diploma thesis - it was slow and unstable at that time. I ended up getting pretty hooked on the problem. Right now I’m taking a professional break and decided to finally use the time to push these ideas further, and build MiniWord — a WYSIWYG word processor in Python. My goal is to have a native, non-HTML-based editor that stays simple, fast, and is hackable. So far I am focusing on getting the fundamentals right.…
Apr 2026 · codeberg.org · its alternatives →
15
I built a CSV parser to try Go 1.26's new SIMD package▲8
Hey HN, A CSV parser using Go 1.26's experimental simd/archsimd package. I wanted to see what the new SIMD API looks like in practice. CSV parsing is mostly "find these bytes in a buffer"—load 64 bytes, compare, get a bitmask of positions. The interesting part was handling chunk boundaries correctly (quotes and line endings can split across chunks). - Drop-in replacement for encoding/csv - ~20% faster for unquoted data on AVX-512 - Quoted data is slower (still optimizing) - Scalar fallback for non-AVX-512 Requires GOEXPERIMENT=simd.…
Jan 2026 · github.com · its alternatives →
16
A simple lazy Python calculation engine, with spreadsheet demo▲123
Simple Python Calculation Engine. Contribute to bsdz/calcengine development by creating an account on GitHub.
2021 · github.com · its alternatives →
17
A Fast, Malloc-Free C++14 Json Parser and Encoder▲98
Meta programming utilities for C++14. Merged in matt-42/lithium - matt-42/iod
2014 · github.com · its alternatives →
18
A weekend replication of STOKE, a stochastic superoptimiser▲58
Haskell re-implementation of STOKE, the stochastic superoptimizer - blaze/notebooks/tutorial.ipynb at master · bollu/blaze
2019 · github.com · its alternatives →
19
StringZilla v3 with C++, Rust, and Swift bindings, and AVX-512 and NEON▲15
Hi HN! I've spent the last few weeks optimizing the string operations in StringZilla. You'd be surprised how much performance GLibc and the Standard Templates Library of C++ are leaving on the table, especially on Arm and, likely, on RISC-V. I've significantly increased the number of implemented algorithms for different workloads. Searching across English texts on Arm, for example: - is 4.4x faster than STL, - and 16.8x faster in reverse order. The new version of the library now includes a C++ binding largely compatible with the C++ Standard, featuring all 17 overloads of the `replace`…
2024 · github.com · its alternatives →
20UI
USearch Images demo in 200 lines of Python▲9
Hey everyone! I am excited to share updates on four of my & my teams' open-source projects that take large-scale search systems to the next level: USearch, UForm, UCall, and StringZilla. These projects are designed to work seamlessly together, end-to-end—covering everything from indexing and AI to storage and networking. And yeah, they're optimized for x86 AVX2/512 and Arm NEON/SVE hardware. USearch [1]: Think of it as Meta FAISS on steroids. It's now quicker, supports clustering of any granularity, and offers multi-index lookups. Plus, it's got more native bindings than probably…
2023 · usearch-images.com · its alternatives →
21
Minibatch – Python stream processing▲50
Python stream processing for humans. Contribute to omegaml/minibatch development by creating an account on GitHub.
2020 · github.com · its alternatives →
22
I wrote an autodiff in C++ and implemented LeNet with it▲36
2024 · gitlab.com · its alternatives →
23OS
Open-source SIMD-accelerated math library for C/C++/C#/Java/FORTRAN▲9
2013 · yeppp.info · its alternatives →
24
C++11 immutable string▲23
I'm looking for feedback on this approach to an immutable string (istring). The idea is to provide a super fast immutable string that can be efficiently passed to lambdas as well as be 100% thread safe. Another bonus is faster hashing. If a string literal is given to istring, then the hash is computed at compile time! Other strings will have their hashes cached for later use. The istring is designed more or less after the python string in this regard. It should also consume less memory than std::string and perform faster in all other areas.
2014 · github.com · its alternatives →

Also compare

Ranked by how close each launch is in meaning, then by votes. Prices were read from each product’s own site when checked and can change. Refine with your own description →