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 15:10M-RochatM-RochatScore: 10,351Success
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 15:2010,17792,845,54676,850,0006,608,0002,113,536
2May 17, 2026 15:2010,21294,389,07977,297,0006,443,0002,113,536
3May 17, 2026 15:2010,24695,606,27477,357,0006,668,0002,117,632
4May 17, 2026 15:2010,34794,633,57078,445,0006,404,0002,113,536
5May 17, 2026 15:2010,35194,269,03778,192,0006,690,0002,113,536
6May 17, 2026 15:2010,38194,411,77278,821,0006,310,0002,113,536
7May 17, 2026 15:2010,49595,627,98179,638,0006,423,0002,113,536
8May 17, 2026 15:2022,313192,277,680175,580,0007,390,0002,117,632
9May 17, 2026 15:2022,729195,762,346178,708,0007,670,0002,117,632