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 10, 2026 10:04Pavel SkripkinPavel SkripkinScore: 26,059Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:054,43049,793,21533,210,0003,116,0002,527,232
2May 10, 2026 10:0525,011222,049,925201,956,0003,141,0002,420,736
3May 10, 2026 10:0525,927227,098,660208,466,0004,142,0002,342,912
4May 10, 2026 10:0525,988225,778,294209,832,0003,276,0002,383,872
5May 10, 2026 10:0526,059230,391,739210,508,0003,181,0002,433,024
6May 10, 2026 10:0526,125229,347,902211,172,0003,059,0002,514,944
7May 10, 2026 10:0526,159226,798,845211,348,0003,162,0002,469,888
8May 10, 2026 10:0526,193230,378,921211,532,0003,255,0002,334,720
9May 10, 2026 10:0526,413232,242,790213,342,0003,246,0002,420,736