Hashed sorting is typically faster than hash tables
Problem statement: count the unique values in a large array of mostly-unique uint64s.
weeklyfoo #102 / 2025-09-15algorithmssorting
ð° sorting
Writing down (and searching through) every UUID
Hashed sorting is typically faster than hash tables
Problem statement: count the unique values in a large array of mostly-unique uint64s.
weeklyfoo #102 / 2025-09-15Writing down (and searching through) every UUID