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 17, 2026 00:26M-RochatM-RochatScore: 17,425Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 00:2912,594113,886,41097,613,0005,661,0002,113,536
2May 17, 2026 00:2912,604112,411,28197,699,0005,655,0002,113,536
3May 17, 2026 00:2912,760113,834,92998,964,0005,671,0002,113,536
4May 17, 2026 00:2917,422151,634,454137,049,0005,812,0002,113,536
5May 17, 2026 00:2917,425153,597,433137,161,0005,732,0002,117,632
6May 17, 2026 00:2917,469152,099,608136,567,0006,684,0002,117,632
7May 17, 2026 00:2917,489152,811,354136,738,0006,676,0002,117,632
8May 17, 2026 00:2917,646153,520,891137,996,0006,708,0002,117,632
9May 17, 2026 00:2917,746154,611,127139,056,0006,467,0002,117,632