📋

Quick Reference

System Design Cheat Sheet

Every number, formula, and decision tree you need in one place. Print it, bookmark it, review it before your interview.

Latency Numbers Every Engineer Should Know

Jeff Dean's classic numbers, updated for modern hardware (2026).

OperationLatencyCategory
L1 cache reference0.5 nsCPU
Branch mispredict5 nsCPU
L2 cache reference7 nsCPU
Mutex lock/unlock25 nsCPU
Main memory reference100 nsMemory
Compress 1 KB with Snappy3 μsMemory
Send 1 KB over 1 Gbps network10 μsNetwork
Read 4 KB randomly from SSD150 μsDisk
Read 1 MB sequentially from memory250 μsMemory
Round trip within same datacenter500 μsNetwork
Read 1 MB sequentially from SSD1 msDisk
HDD seek10 msDisk
Read 1 MB sequentially from HDD20 msDisk
Send packet CA → NL → CA150 msNetwork

💡 Key insight: Memory is ~100× faster than SSD. SSD is ~100× faster than HDD. Network round-trip in a datacenter ≈ 500μs.

Powers of Two

210

1 Thousand

1 KB

220

1 Million

1 MB

230

1 Billion

1 GB

240

1 Trillion

1 TB

250

1 Quadrillion

1 PB

QPS Rules of Thumb

1

1 web server

1K–10K RPS

2

1 database (SQL)

5K–30K QPS

3

1 Redis instance

100K–500K QPS

4

1 Kafka broker

200K–1M msg/s

5

1 CDN PoP

100K+ RPS

Availability Nines

LevelAvailabilityDowntime / Year
Two nines99%3.65 days/year
Three nines99.9%8.77 hours/year
Four nines99.99%52.6 min/year
Five nines99.999%5.26 min/year
Six nines99.9999%31.5 sec/year

💡 Most SaaS companies target 99.9%–99.99%. Serial components multiply availability (0.999 × 0.999 = 0.998). Parallel (redundant) components: 1 − (1−A)² = higher.

Common Storage Estimates

1 chat message~100 bytes
1 tweet / post~250 bytes (text)
1 photo (compressed)~200 KB
1 short video (1 min)~10 MB
1 HD video (1 min)~150 MB
1 user profile~1 KB
1 URL mapping~500 bytes
1 log entry~100–500 bytes

Back-of-Envelope Formulas

1

QPS

Daily Active Users × Avg Requests/User / 86,400

Example: 10M × 5 / 86400 ≈ 580 QPS

2

Peak QPS

QPS × 2–3 (peak factor)

Example: 580 × 3 ≈ 1,740 QPS

3

Storage (5 yr)

Writes/day × size × 365 × 5

Example: 50M × 250B × 1825 ≈ 22.8 TB

4

Bandwidth

QPS × avg response size

Example: 1K × 500KB = 500 MB/s

5

Cache Memory

QPS × response size × cache TTL

Example: 1K × 1KB × 300s = 300 MB

6

Number of Servers

Peak QPS / single server QPS

Example: 10K / 2K = 5 servers

Quick Decision Trees

45-Minute Interview Checklist

1

1. Clarify Requirements

Functional & non-functional. Users, scale, latency, consistency.

2

2. Back-of-Envelope

QPS, storage, bandwidth, memory. Show the math.

3

3. API Design

Key endpoints, request/response schema, auth.

4

4. Data Model

Entities, relationships, database choice with justification.

5

5. High-Level Design

Draw boxes: clients → LB → services → cache → DB → queues.

6

6. Deep Dives

Pick 2-3 interesting areas. Discuss trade-offs in depth.

7

7. Bottlenecks & Scaling

Identify bottlenecks. Propose solutions. Discuss limits.

8

8. Wrap Up

Summarize trade-offs. Mention what you'd improve with more time.

⏱️ Time allocation: Requirements (5 min) → Estimation (5 min) → API/Data Model (5 min) → High-Level Design (10 min) → Deep Dives (15 min) → Wrap Up (5 min)

Common Acronyms

ACIDAtomicity, Consistency, Isolation, Durability
BASEBasically Available, Soft state, Eventually consistent
CAPConsistency, Availability, Partition tolerance
CQRSCommand Query Responsibility Segregation
CDNContent Delivery Network
CRDTConflict-free Replicated Data Type
DNSDomain Name System
EDAEvent-Driven Architecture
ELBElastic Load Balancer
gRPCGoogle Remote Procedure Call
HDFSHadoop Distributed File System
LSMLog-Structured Merge tree
MVCCMulti-Version Concurrency Control
OTOperational Transformation
QPSQueries Per Second
RPCRemote Procedure Call
SLAService Level Agreement
SLIService Level Indicator
SLOService Level Objective
SSEServer-Sent Events
SSTSorted String Table
TPSTransactions Per Second
TTLTime To Live
WALWrite-Ahead Log
2PCTwo-Phase Commit

Ready to go deeper?

Explore structured topics with interactive diagrams, quizzes, and code examples.