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 listMay 1, 2026 18:08Pavel SkripkinPavel SkripkinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 18:090118,081,913103,101,0001,000,0002,318,336expected "2181230093 ", got "2206402882 "
2May 1, 2026 18:0912,676122,160,201102,949,000999,0002,428,928
3May 1, 2026 18:0912,710119,692,634103,227,0001,002,0002,318,336
4May 1, 2026 18:0912,715117,674,990103,262,0001,002,0002,428,928
5May 1, 2026 18:0912,735119,143,168103,423,0001,004,0002,326,528
6May 1, 2026 18:0912,748122,276,643103,536,0001,005,0002,420,736
7May 1, 2026 18:0912,797120,317,557102,941,0001,998,0002,420,736
8May 1, 2026 18:0912,801122,617,828102,976,0001,999,0002,416,640
9May 1, 2026 18:0912,817122,429,000103,100,0002,001,0002,420,736