﻿<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
    <channel>
        <atom:link href="https://www.hibit.dev/rss/posts/297" rel="self" type="application/rss+xml" />
        <title><![CDATA[HyperLogLog for counting unique elements with fixed memory]]></title>
        <description><![CDATA[<p>Counting unique visitors sounds like a small task until the numbers grow. Every distinct ID has to be remembered, every new visit needs a check against the ones already seen and memory keeps rising with each new person. HyperLogLog is an algorithm that skips the remembering. It estimates how many different items went through a stream while keeping a few kilobytes of state and in return it accepts a small error that can be measured in advance.</p>]]></description>
        <link><![CDATA[https://www.hibit.dev/posts/297/hyperloglog-for-counting-unique-elements-with-fixed-memory]]></link>
        <pubDate>Mon, 16 Nov 2026 08:15:03 +0000</pubDate>
        <language>en</language>
        <category>development</category>

        <image>
            <title>hyperloglog-for-counting-unique-elements-with-fixed-memory</title>
            <link><![CDATA[https://www.hibit.dev/posts/297/hyperloglog-for-counting-unique-elements-with-fixed-memory]]></link>
            <url><![CDATA[https://www.hibit.dev/images/posts/2026/11/1/headers/2730_hyperloglog.png]]></url>
            <width>200></width>
            <height>200></height>
        </image>
    </channel>
</rss>
