Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listJun 22, 2026 22:50Victor MerckléVictor MerckléScore: 3,320Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 22:503,22133,856,42725,347,0001,068,0002,113,536
2Jun 22, 2026 22:503,24434,037,43025,573,0001,033,0002,113,536
3Jun 22, 2026 22:503,24834,082,25225,568,0001,069,0002,113,536
4Jun 22, 2026 22:503,25634,155,72925,630,0001,070,0002,113,536
5Jun 22, 2026 22:503,32034,805,37526,172,0001,057,0002,113,536
6Jun 22, 2026 22:5012,090106,597,59398,135,0001,011,0002,113,536
7Jun 22, 2026 22:5012,124106,882,09098,401,0001,016,0002,113,536
8Jun 22, 2026 22:5012,151107,085,12798,630,0001,012,0002,113,536
9Jun 22, 2026 22:5012,223107,680,72999,213,0001,017,0002,113,536