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 1, 2026 10:12Victor MerckléVictor MerckléScore: 2,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 10:132,74030,669,29421,451,0001,017,0002,117,632stderr
2Sep 1, 2026 10:132,74930,916,88921,428,0001,121,0002,117,632stderr
3Sep 1, 2026 10:132,75631,770,17321,544,0001,056,0002,117,632stderr
4Sep 1, 2026 10:132,75730,794,75221,558,0001,052,0002,117,632stderr
5Sep 1, 2026 10:132,76031,780,36021,535,0001,098,0002,117,632stderr
6Sep 1, 2026 10:135,39652,802,13243,240,0001,015,0002,117,632stderr
7Sep 1, 2026 10:135,41853,547,40043,412,0001,022,0002,117,632stderr
8Sep 1, 2026 10:135,43152,805,99343,520,0001,019,0002,117,632stderr
9Sep 1, 2026 10:135,44652,745,68743,642,0001,016,0002,117,632stderr