HyperLogLog - an algorithm for approximating the number of distinct elements by axiomhq
HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
About HyperLogLog - an algorithm for approximating the number of distinct elements
From the project's README at github.com/axiomhq/hyperloglog. Lightly cleaned for readability; for the full source see the upstream repo.
[](https://godoc.org/github.com/axiomhq/hyperloglog) [](https://goreportcard.com/report/github.com/axiomhq/hyperloglog) [](https://circleci.com/gh/axiomhq/hyperloglog/tree/master)
An improved version of HyperLogLog for the count-distinct problem, approximating the number of distinct elements in a multiset. This implementation offers enhanced performance, flexibility, and simplicity while maintaining accuracy. Note on Implementation History
The initial version of this work (tagged as v0.1.0) was based on "Better with fewer bits: Improving the performance of cardinality estimation of large data streams - Qingjun Xiao, You Zhou, Shigang Chen". However, the current implementation has evolved significantly from this original basis, notably moving away from the tailcut method. Current Implementation
The current implementation is based on the LogLog-Beta algorithm, as described in:
Health score breakdown
6-dimension composite. See methodology for formula and weights.
Adoption signals
Real-world usage data, pulled from each registry. The bigger the numbers, the more battle-tested the project.
| Signal | Value | Source |
|---|---|---|
| GitHub stars | 1.0k | github.com/axiomhq/hyperloglog |
| GitHub forks | 80 | github.com/axiomhq/hyperloglog |
Release & maintenance
Is this project actively maintained, or about to die? Check the recency of last commit and last release.
| Project age | 9.0 years | since Jun 2017 |
| Last commit | 6 months ago | Dec 16, 2025 |
| Releases shipped | 6 | last: 6 months ago |
Self-hosting cost across providers
Detected requirements: 4GB RAM, 40GB disk minimum. Cheapest plan per provider that meets the requirement.
| Provider | Plan | Specs | Monthly | |
|---|---|---|---|---|
| hetzner | CAX11 | 2c · 4GB · 40GB | $4.13 USD | Deploy → |
| vultr | VC2 | 1c · 1GB · 25GB | $5 USD | Deploy → |
| linode | Nanode 1GB | 1c · 1GB · 25GB | $5.12 USD | Deploy → |
| digitalocean | Basic Regular 1GB | 1c · 1GB · 25GB | $6 USD | Deploy → |
What people say on Hacker News
Ready to self-host HyperLogLog - an algorithm for approximating the number of distinct elements?
Spin up a hetzner CAX11 (4GB RAM, 40GB disk) for $4.13/mo and follow the project's official install docs.
Data last refreshed Jun 21, 2026.
Similar open-source projects
Projects in our directory that replace the same SaaS or share topics with HyperLogLog - an algorithm for approximating the number of distinct elements.