SESSION ON-DEMAND

All Things P99

The event for developers who care about P99 percentiles and high-performance, low-latency applications

40x Faster Binary Search

This talk will first expose the lie that binary search takes O(lg n) time — it very much does not! Instead, we will see that binary search has only constant overhead compared to an oracle. Then, we will exploit everything that modern CPUs have to offer (SIMD, ILP, prefetching, efficient caching) in order to gain 40x increased throughput over the Rust standard library implementation.

22 minutes
Register for access to all 60+ sessions available on demand.
Fill out the form to watch this session from the P99 CONF 2025 livestream. You’ll also get access to all available recordings.

Ragnar Groot Koerkamp, PhD at ETH Zurich

Ragnar recently obtained his PhD in high throughput bioinformatics at ETH Zurich. His work is on writing high performance libraries for fundamental tasks in bioinformatics, such as minimal perfect hashing, and designing algorithms and datastructures that are optimized for modern hardware. Ragnar is author of the blog curiouscoding.nl.