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 listSep 28, 2026 19:45C21C21Score: 5,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2026 19:465,11352,408,14739,625,0002,305,0002,113,536
2Sep 28, 2026 19:465,11652,434,85139,774,0002,181,0002,113,536
3Sep 28, 2026 19:465,12852,561,00439,945,0002,105,0002,113,536
4Sep 28, 2026 19:465,13153,321,76239,957,0002,125,0002,113,536
5Sep 28, 2026 19:465,13852,569,47040,035,0002,100,0002,113,536
6Sep 28, 2026 19:465,19353,059,36140,536,0002,047,0002,113,536
7Sep 28, 2026 19:465,19553,795,35640,475,0002,132,0002,113,536
8Sep 28, 2026 19:465,20653,182,30640,496,0002,197,0002,113,536
9Sep 28, 2026 19:465,31054,692,41341,416,0002,126,0002,113,536