Problems / Databases, medium
A metrics system scrapes 400 targets a second on average, but scrapes line up every 15 seconds and 5× as many land at once on a 2-vCPU time-series database.
Unlock it once for 15 credits; everything inside it is free (runs, changes, Submit, results, hints). Sign in with Google to start; new accounts get free credits.
Success ≥ 99%, p99 ≤ 2 s.
Like a coding problem, a solution has to pass every case, not just the one it was built for. Submit in the lab runs all 4; 1 of them are hidden until then.
400 requests a second, with 5× bursts every 15 s for 30 seconds: 100% writes.
What each component does in this design, and what calls it. The simulator mimics each one from these settings.
| Component | Its job here | Settings |
|---|---|---|
| Load balancerLoad balancer | Traffic enters here.Calls Collector.Layer 4 balancers route by IP and port; layer 7 balancers read HTTP and can route by path or header. | – |
| CollectorApp service | Load balancer forwards to it.Calls Time-series DB.Little's law: throughput ≈ concurrency ÷ latency. 200 slots at 50 ms serve about 4,000 req/s. | 3 replicas × 200 slots · timeout 4.0 s |
| Time-series DBTime-series database | Collector calls it.Time-series databases compress by time and downsample old data to keep storage small. | 500 slots |