Search several tenant-authorized providers with incompatible native scores. Use a deterministic rank-fusion policy over bounded source results, and distinguish a best-effort page from an exhaustive global ranking.

02 · Define success

Requirements

Authorize each source and result before disclosure.
Use bounded parallel fan-out with per-source deadlines.
Merge by stable identities under a versioned fusion rule.
Pin pagination inputs or disclose best-effort changes.

Open the design canvas Read the analysis first

01 · Understand the problem

Your mission

02 · Define success

Requirements

Authorize each source and result before disclosure.
Use bounded parallel fan-out with per-source deadlines.
Merge by stable identities under a versioned fusion rule.
Pin pagination inputs or disclose best-effort changes.

Open the design canvas Read the analysis first

Design envelope

15,000
peak reads / s: 100
writes / s: 800 ms
target read p99: 2000 B
record size

Workload assumptions for this exercise, not measured production limits.

Think about request flow, durable state, hot paths and failure boundaries.

How this problem works

Design — place components and connect them on the canvas, then write your contracts.
Decide — pick the policies you would defend and note the trade-offs.
Review — run the rule-based review. Pass every check to complete the problem and add it to your review deck.

The review checks a guided model. Other valid architectures exist; it does not execute code or prove production readiness.

3day streak