<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Sorted-Sets | System Design</title><link>https://system-design.devops-monk.com/tags/sorted-sets/</link><description>In-depth system design tutorials — from zero to millions of users. Written for engineers who want to understand how large-scale systems actually work.</description><language>en-us</language><managingEditor>abhaypratap3537@gmail.com (Abhay)</managingEditor><webMaster>abhaypratap3537@gmail.com (Abhay)</webMaster><lastBuildDate>Sun, 06 Sep 2026 22:11:29 +0000</lastBuildDate><atom:link href="https://system-design.devops-monk.com/tags/sorted-sets/index.xml" rel="self" type="application/rss+xml"/><item><title>Design a Real-time Gaming Leaderboard</title><link>https://system-design.devops-monk.com/2026/06/design-gaming-leaderboard/</link><pubDate>Sat, 13 Jun 2026 10:00:00 +0000</pubDate><guid isPermaLink="true">https://system-design.devops-monk.com/2026/06/design-gaming-leaderboard/</guid><author>abhaypratap3537@gmail.com (Abhay)</author><category>Case Studies</category><description>Ranking 25 million players in real time. Why SQL cannot do it, how a skip list makes it O(log n), and the sharding problem that has no clean answer — with a live leaderboard you can play with.</description><enclosure url="https://system-design.devops-monk.com/images/articles/gaming-leaderboard.webp" type="image/webp" length="0"/><content:encoded><![CDATA[<p><img src="https://system-design.devops-monk.com/images/articles/gaming-leaderboard.webp" alt="Design a Real-time Gaming Leaderboard" /></p><p>Ranking 25 million players in real time. Why SQL cannot do it, how a skip list makes it O(log n), and the sharding problem that has no clean answer — with a live leaderboard you can play with.</p><p><a href="https://system-design.devops-monk.com/2026/06/design-gaming-leaderboard/">Read the full article &rarr;</a></p>]]></content:encoded></item></channel></rss>