Skip to contentSkip to content
Verified credentials. On-chain. Forever.Learn more
Ewance
Sign in
Cover image for Design a Lock-Free Concurrent Queue for an Event Bus
Code

Design a Lock-Free Concurrent Queue for an Event Bus

FreeVerified credential3 weeksAdvanced

Overview

What this challenge is about.

Build a lock-free MPSC ring-buffer in Go with atomics, prove correctness under load, and benchmark against a mutex version. Get a verifiable certificate.

The scenario

The consumer-mobile company (Series B, KRW 65B revenue) has a hard p99 backend latency budget of 35 ms and the event bus is the current bottleneck.

CredentialBlockchain-anchored
ShareableLinkedIn-ready
LanguageEnglish
PaceSelf-paced

The Brief

What you'll do, and what you'll demonstrate.

Ship a lock-free MPSC ring-buffer queue in Go that beats a mutex-protected slice on throughput and p99 latency, with race-detector evidence of correctness.

Earning criteria — what you'll demonstrate

  • Implement an MPSC ring-buffer queue using atomic operations only
  • Reason about memory ordering and the Go memory model
  • Use the race detector to prove (not just check) correctness
  • Benchmark concurrent code honestly, accounting for cache effects

Program Fit

Where this fits in your program.

Sharpens the same skills your degree expects you to demonstrate.

Data Structures

Bachelor · Algorithms

Strong alignment

This challenge maps to Data Structures at the Bachelor level. It sharpens the same practical skills your coursework expects — but in a real industry context with actual constraints and deliverables.

One more thing

You can put a credential on your CV by Friday.