hyperloglog is an algorithm for the count-distinct problem, approximating the number of distinct elements in a multiset. calculating the "exact" cardinality of a multiset requires an amount of memory proportional to the cardinality, which is impractical for very large data sets. probabilistic cardinality estimators, such as the hyperloglog algorithm, use significantly less memory than this, at the cost of obtaining only an approximation of the cardinality. the hyperloglog algorithm is able to estimate cardinalities of > 10 with a typical accuracy (standard error) of 2%, using 1.5 kb of memory. hyperloglog is an extension of the earlier loglog algorithm, itself deriving from the 1984 flajolet–martin algorithm.