Faster than Rust and C++: the PERFECT hash table
I had a week of fun designing and optimizing a perfect hash table. In this video, I take you through the journey of making a hash table 10 times faster and share performance tips along the way. 00:00 why are hash tables important? 00:31 how hash tables work 02:40 a naïve hash table 04:35 custom hash function 08:52 perfect hash tables 12:03 my perfect hash table 14:20 beating gperf 17:24 beating memcmp 21:46 beating SIMD 26:01 even faster? 30:06 pop quiz answers 31:45 beating cmov 33:09 closing thoughts Thanks: Dave Churchill: / davechurchill My Twitch chat: / strager Jennipuff: / jenipuff Attribution: Thumbnail artwork by Jennipuff JavaScript logo by Christopher Williams under MIT license PHP logo copyright Colin Viebrock, Creative Commons Attribution-Share Alike 4.0 International Ruby logo copyright © 2006, Yukihiro Matsumoto, Creative Commons Attribution-ShareAlike 2.5
The Dark Side of .reserve()
Big O myths busted! (Time complexity is complicated)
Hash Tables - CS50 Shorts
Think Twice Before Using Async Rust | Prime Reacts
Creator of C++: Bell Labs, Negative Overhead Abstraction, Mistakes | Bjarne Stroustrup
going fast is about doing less
C++ vs Rust: which is faster?
Insane Shadow Data Trick in C
Faster Go Maps With Swiss Tables - Michael Pratt | GopherCon EU 2025
CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”
HashMaps & Dictionaries, Explained Simply
C++Now 2018: You Can Do Better than std::unordered_map: New Improvements to Hash Table Performance
Lecture 8: Hashing with Chaining
Hash Tables and Hash Functions
Why C and C++ Still Matter — And Why Most People Struggle to Learn Them
All Rust string types explained
Constructors Are Broken
Tips for C Programming
Garbage Collection (Mark & Sweep) - Computerphile
