<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Unique-Id-Generator on Sumeet's Blog</title><link>https://the-sumeet.github.io/tags/unique-id-generator/</link><description>Recent content in Unique-Id-Generator on Sumeet's Blog</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sat, 21 Feb 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://the-sumeet.github.io/tags/unique-id-generator/index.xml" rel="self" type="application/rss+xml"/><item><title>Unique ID Generator</title><link>https://the-sumeet.github.io/posts/unique-id-generator/</link><pubDate>Sat, 21 Feb 2026 00:00:00 +0000</pubDate><guid>https://the-sumeet.github.io/posts/unique-id-generator/</guid><description>In a single database where you can just use an auto_increment column, distributed systems have multiple nodes working simultaneously. If they don&amp;rsquo;t coordinate perfectly, they might accidentally hand out the same ID to two different users.
To solve this, we need a strategy that ensures IDs are
Unique and sortable. The system should be able to generate 10,000 IDs per second. Max 64 bits. Common Approaches UUID UUIDs are 128-bit number generated locally by each node using a combination of time, node ID, and randomness.</description></item></channel></rss>