December 27, 2025
Fast code, faster drama
Tieredsort: Header only, blazing fast (3-4x) C++17 sorting for numeric types
Dev boasts ‘30x’ on real data; commenters cheer, nitpick math, and drop one‑word takedowns
TLDR: Tieredsort is a drop‑in sorting tool claiming huge speed gains on everyday number lists, even topping standard options. The community’s split: fans applaud the balance and real‑world wins, a critic dismisses it with “Slop,” and pedants debate the math wording—because speed is cool, but bragging rights are hotter.
A new C++ sorting tool called tieredsort just hit GitHub, flexing big numbers: up to 30x faster on “dense” everyday data like ages and ports, and a clean sweep across 15 real‑world tests. It’s header‑only (translation: one file you plop in) and even claims speed without special chip tricks. The demo shows it auto‑picking the best method for your numbers—sounds simple, sounds fast, sounds… controversial.
The crowd instantly split. One camp is clapping: user icsa calls it a “good balance between performance and complexity,” basically praising it for being smart without turning into a science project. Then the drama: nemetroid rolls in with a single-word roast—“Slop.”—and drops a dev response link like gasoline on a barbecue. Meanwhile, the Math Police arrive: on_the_train corrects the headline’s “x faster” phrasing, insisting it should be “x as fast,” kicking off the classic internet fight where stopwatch nerds square up against grammar nerds.
Jokes fly about speed cults, “30x on my grandma’s age list,” and whether header‑only means “copy‑paste engineering.” But behind the memes, people notice the key bit: tieredsort crushes small‑range numbers (like 0–100) and still beats the usual suspects elsewhere. Verdict from the arena? Impressive claims, spicy pushback, and a dev ready with receipts. Popcorn secured.
Key Points
- •tieredsort is a header-only C++17 sorting library for numeric types that adaptively selects std::sort, counting sort, or radix sort.
- •Benchmarks show 13.16x average speedup vs std::sort across 15 real-world patterns and 1.88x overall vs ska_sort, with 15/15 wins.
- •Synthetic benchmarks (n=100,000) report 1,402 µs on random and 102 µs on dense 0–100, outperforming std::sort and ska_sort.
- •Correctness was validated with 34 tests, multiple sizes (10K–1M), 10 seeds, and statistical significance (100 runs, p < 0.001).
- •Detection overhead is ~100 CPU cycles; installation options include single-header download and CMake FetchContent via GitHub.