C
Curious Coding
curiouscoding.nl · Personal blog · on HN since 2021
Curious Coding is a blog about fast algorithms and data structures, with posts on search trees, hashing, SIMD and Rust.
What HN saysHN links its static search trees post, which drew a large discussion of how it beats binary search by a wide margin.
15HN people shared it
3linked it in comments
15stories submitted
680story points
4 months agolast shared
2021people per year2026
Most-shared posts
- 1Static search trees: faster than binary search6 people · 662 points · first shared 2024 · 232 comments on HN
- 2One Billion Row Challenge in Rust2 people · 4 points · first shared 2024 · 1 comments on HN
- 3QuickHeap: A Fast Priority Queue2 people · 3 points · first shared 2026 · discussion on HN
- 4PtrHash: Minimal Perfect Hashing at RAM Throughput2 people · 2 points · first shared 2025 · discussion on HN
- 516th place: Our bugs and strategy at Hashcode 20211 people · 3 points · first shared 2021 · discussion on HN
- 6Chunking for Fasta Parsing1 people · 2 points · first shared 2025 · discussion on HN
- 7SimdSketch: A Fast Bucket Sketch1 people · 2 points · first shared 2025 · discussion on HN
- 8Deflate, gzip, zlib, libz, et al.1 people · 1 points · first shared 2026 · discussion on HN
- 9CPU Performance1 people · 1 points · first shared 2025 · discussion on HN
- 10Ptrhash paper1 people · first shared 2025
- 11P99 text1 people · first shared 2026
What HN people wrote when they linked it
itamarst · 2026-07-17
When this was posted to lobsters someone shared this relevant link: https://curiouscoding.nl/posts/static-search-tree/
attractivechaos · 2026-04-30
See also: Static search trees: 40x faster than binary search
- https://curiouscoding.nl/slides/p99-text/
- https://curiouscoding.nl/posts/static-search-tree/
- https://news.ycombinator.com/item?id=42562847 (656 points; 232 comments)
curiouscoding · 2025-01-01
Hmm, bitmaps is an interesting idea! If the data is dense enough, then yeah I guess a quick linear scan would work.
There's also the extreme of simply storing the answer for each possible query as a u32 and just index the array, but there the overhead is much larger.
Rank-select is also interesting, but I doubt it comes anywhere close in performance.
I happen to also be working on a minimal perfect hashing project that has way higher throughput than other methods (mostly because batching), see https://curiouscoding.nl/posts/ptrhash-paper/ and the first post linked from there.