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 listJan 2, 2026 05:43Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 5, 2026 21:26Andrew Epstein13.64CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 21:31049,182,44434,158,0003,088,00016,384No answer to stdout. Died or killed?
2Jan 2, 2026 05:437,16985,232,22051,810,0006,974,0002,277,376
3Jan 2, 2026 05:437,23483,622,69953,286,0006,032,0002,293,760
4Jan 2, 2026 05:437,29391,367,71255,816,0003,986,0002,371,584