Top all-time · #5151
Ragnar Groot Koerkamp
Personal blog · curiouscoding.nl/posts · on HN as curiouscodingprogrammingsystems
Ragnar Groot Koerkamp's personal blog at curiouscoding.nl covers programming and systems. Since 2021, 15 different Hacker News readers have linked it 19 times, most often “Static search trees: faster than binary search”. No feed was found, so read it on the site itself.
Too few sampled comments (2) to say how often HN recommends it.?
Why HN links it
HN readers link posts on static search trees and beating binary search, with speed comparisons and a slide deck on the same topic. Comments are bare links or 'see also' references.
Summarised by Claude from a sample of 2 HN comments that link here. Each comment is marked recommending, critical or neutral (citing without judging); how this works.
Most-linked posts?
- Static search trees: faster than binary search6 people · 6 mentions · first linked 2024-12-31
- QuickHeap: A Fast Priority Queue2 people · 2 mentions · first linked 2026-05-03
- One Billion Row Challenge in Rust2 people · 2 mentions · first linked 2024-04-17
- PtrHash: Minimal Perfect Hashing at RAM Throughput2 people · 2 mentions · first linked 2025-02-24
What Hacker News says?
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 t…
Comment linking /posts/ptrhash-paper/
on “Static search trees: faster than binary search”Submitted Static search trees: faster than binary search as a story · 656 points
HN discussionSee 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)
Comment linking /posts/static-search-tree/
on “You can beat the binary search”Submitted Static Search Trees as a story · 3 points
HN discussionWhen this was posted to lobsters someone shared this relevant link: https://curiouscoding.nl/posts/static-search-tree/
Comment linking /posts/static-search-tree/
on “6× faster binary search: from compiled code to mechanical sympathy”Submitted One Billion Row Challenge in Rust as a story · 3 points
HN discussionSubmitted 16th place: Our bugs and strategy at Hashcode 2021 as a story · 3 points
HN discussionSubmitted Static search trees: 40x faster than binary search (2024) as a story · 2 points
HN discussionSubmitted QuickHeap: A Fast Priority Queue as a story · 2 points
HN discussionSubmitted Chunking for Fasta Parsing as a story · 2 points
HN discussionSubmitted SimdSketch: A Fast Bucket Sketch as a story · 2 points
HN discussionSubmitted Quickheap: The fastest comparison-based heap? as a story · 1 points
HN discussionSubmitted PtrHash: Minimal Perfect Hashing at RAM Throughput as a story · 1 points
HN discussionSubmitted Deflate, gzip, zlib, libz, et al. as a story · 1 points
HN discussionSubmitted Static search trees: 40x faster than binary search · CuriousCoding as a story · 1 points
HN discussionSubmitted PtrHash: Minimal Perfect Hashing at RAM Throughput as a story · 1 points
HN discussionSubmitted CPU Performance as a story · 1 points
HN discussionSubmitted One Billion Row Challenge as a story · 1 points
HN discussion
