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 12:36Victor MerckléVictor MerckléScore: 2,749Success
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 12:372,70730,890,15821,060,0001,138,0002,117,632stderr
2Sep 1, 2026 12:372,74031,538,57821,405,0001,063,0002,117,632stderr
3Sep 1, 2026 12:372,74030,632,76321,395,0001,076,0002,117,632stderr
4Sep 1, 2026 12:372,74131,013,56521,417,0001,065,0002,117,632stderr
5Sep 1, 2026 12:372,74930,701,38921,472,0001,074,0002,117,632stderr
6Sep 1, 2026 12:372,77631,921,99221,703,0001,063,0002,117,632stderr
7Sep 1, 2026 12:375,39252,565,29043,163,0001,059,0002,117,632stderr
8Sep 1, 2026 12:375,40753,470,02643,278,0001,063,0002,117,632stderr
9Sep 1, 2026 12:375,41852,769,33943,369,0001,063,0002,117,632stderr