How does HyperLogLog count unique items without storing them?
It hashes every item and examines the distribution of leading zeros in the binary hash output. Since leading zeros are rare (like flipping heads repeatedly), observing many leading zeros statistically implies you've hashed billions of distinct items.
Answered in
Count Billions in 12 KilobytesHyperLogLog estimates cardinality by reading leading zeros in hashed values, trading 1% error for fixed memory.
Read the full analysisOther questions this article answers
More system design questions
- Why doesn't Google just run Dijkstra faster?
- What is a shortcut edge and when is it precomputed?
- How much space do shortcut edges take compared to the original graph?
- Can Contraction Hierarchies handle dynamic graphs like traffic or road closure?
- Why contract low-degree nodes first instead of high-degree ones?
- What is a CRDT and why does it matter for real-time collaboration?
- How do CRDTs handle concurrent edits without a central server referee?
- Why did Figma move from operational transforms to CRDTs?
Every answer on Crashtech is written by the editor of the article it comes from — never auto-summarised. Browse all answers or the System Design beat.