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 08:45Pavel 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 10, 2026 08:460109,063,73784,141,0008,515,0002,314,240expected "1964305971 ", got " "
2May 10, 2026 08:460106,766,67284,477,0008,902,0002,306,048expected "2034460430 ", got " "
3May 10, 2026 08:464,73351,572,64733,155,0005,658,0002,490,368
4May 10, 2026 08:464,76955,766,09433,140,0005,973,0002,371,584
5May 10, 2026 08:464,78155,636,63033,370,0005,837,0002,347,008
6May 10, 2026 08:464,80755,778,65433,280,0006,138,0002,424,832
7May 10, 2026 08:464,84755,909,91133,679,0006,069,0002,375,680
8May 10, 2026 08:464,90557,628,82233,971,0006,253,0002,469,888
9May 10, 2026 08:464,91053,505,38033,865,0006,397,0002,355,200