Write-supremacy concurrent data structure.

Building a lock-free concurrent data structure for ultra-low-latency trading systems

This is a hard C++ coding problem that tests your ability to design and implement a concurrent data structure under real trading constraints. The core challenge is enabling instantaneous writes—the writer must never block, even while readers are active—without using traditional synchronization primitives like mutexes or condition variables.

The problem forces you to reason about the trade-offs between correctness, latency, and memory usage on the efficient frontier. You must handle the single-writer, multiple-reader pattern, allow concurrent read and write operations, and gracefully manage reads that occur before any data has been written. Success requires understanding lock-free techniques, memory ordering, and how to structure data to minimize reader contention while keeping the write path allocation-free and latency-deterministic.

• Lock-free synchronization without mutexes or condition variables
• Memory ordering and atomic operations in concurrent contexts
• Single-writer, multiple-reader design patterns
• Trade-offs between latency, throughput, and memory footprint
• Handling edge cases (reads before first write, concurrent access patterns)