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 7, 2026 15:46Victor MerckléVictor MerckléScore: 2,619Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:472,61229,662,09320,394,0001,030,0002,117,632stderr
2Sep 7, 2026 15:472,61329,777,39920,358,0001,075,0002,117,632stderr
3Sep 7, 2026 15:472,61429,733,17720,422,0001,013,0002,117,632stderr
4Sep 7, 2026 15:472,61529,771,88720,424,0001,025,0002,117,632stderr
5Sep 7, 2026 15:472,61929,654,87420,456,0001,023,0002,117,632stderr
6Sep 7, 2026 15:472,61929,762,32620,471,0001,011,0002,117,632stderr
7Sep 7, 2026 15:472,62330,640,85720,426,0001,088,0002,117,632stderr
8Sep 7, 2026 15:472,62729,870,87220,456,0001,087,0002,117,632stderr
9Sep 7, 2026 15:475,29252,038,50842,145,0001,252,0002,117,632stderr