Menu

A Hash That Collided on Every Name and a 25 MB Allocator Trap: What 4 Tracks of Speed Demon 2026 Taught Us About OS, Cache Hierarchy, and AI
📰

A Hash That Collided on Every Name and a 25 MB Allocator Trap: What 4 Tracks of Speed Demon 2026 Taught Us About OS, Cache Hierarchy, and AI

DEV Community: cpp·Anmol Maheshwari·6 days ago
#hl3DQwsf
#devtocpp#devto#dev#track#thread
Reading 0:00
15s threshold

TL;DR: For Speed Demon 2026 by Hackathon Raptors, our team (cONFIG) rewrote four deliberately slow Python reference implementations in zero-dependency Rust and C++23:

a 3.1M-line log aggregator (Track A, 32.05 s → 0.034 s, 942× )

a 50,000-query boolean and phrase search engine over 256 MB of text (Track B, 56.35 s → 0.252 s, 223× )

a 3.32M-row hostile CSV join (Track C, 14.44 s → 0.052 s, 277× )

a 5M-edge shortest-path solver (Track D, 72.69 s → 0.456 s, 159× )

This is the story of the mistakes that cost us the most time: a hash function that passed every SHA-256 gate while routing 100% of customer names into a single L1 slot, an munmap call that made memory no smaller and wall time worse, Golden Cove L1/L2/L3 cache sizing across 12 hyperthreads, and why golfing line count with AI traps you in a local optimum until you do the hardware and scoring-function math yourself.

Repository: https://github.com/Yash-vs9/cOnfig-tracks

Where All Four Tracks Ended Up

We entered all four tracks with zero external…

Continue reading — create a free account

Join HashtagPLUS to read full articles, follow hashtags, vote, and join the conversation.