HLDintermediatePremium

Real-Time Leaderboard HLD: Your Rank Among 50 Million, Instantly

A real-time leaderboard system design (HLD): why top-N is easy but a single player's rank is hard, the sorted set and order-statistics that make rank O(log n), time windows, and the hot-key at scale.

By fiveyearsdevJune 13, 202612 min read

"Design a real-time leaderboard." The match ends and your screen flashes: "Ranked #2,184,402 — up 9,517 spots." Among fifty million players, the server knew your exact position the instant your score landed — and it does this for every player, thousands of times a second. Stop and ask how, because the obvious answer is a disaster: to know your rank, count everyone with a higher score. That's a scan of fifty million rows, per query, on the hot path. It would melt. Showing the top 10 is trivial — any sorted index hands you the highest few. But a specific player's rank deep in the pack is the que…

What’s inside

Let's start nowhere near a computer

Where the running-count trick runs

Step 1 — Functional requirements (sentences first)

Step 2 — Non-functional requirements

Step 3 — Nouns: the leaderboard is the structure

Step 4 — The two queries, and why one is hard

Step 5 — Rank, with ties, as a prefix count

Step 6 — Trade-offs (each one keeping an NFR)

The complete implementation

Step 7 — Only now, the boxes

Step 8 — Scaling, one bottleneck at a time

Step 9 — When a piece fails: designing for failure

The interview corner

Where to go from here

Read this one free

Sign in and your first premium article is on us — read Real-Time Leaderboard HLD: Your Rank Among 50 Million, Instantly free.

HLD