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:48Victor MerckléVictor MerckléScore: 2,655Success
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:492,62529,990,52720,515,0001,014,0002,117,632stderr
2Sep 1, 2026 12:492,63830,014,44320,572,0001,061,0002,117,632stderr
3Sep 1, 2026 12:492,63930,120,23020,564,0001,079,0002,117,632stderr
4Sep 1, 2026 12:492,64430,148,23320,590,0001,098,0002,117,632stderr
5Sep 1, 2026 12:492,65530,133,83920,709,0001,070,0002,117,632stderr
6Sep 1, 2026 12:492,68230,347,37620,925,0001,072,0002,117,632stderr
7Sep 1, 2026 12:495,31551,990,93342,575,0001,016,0002,117,632stderr
8Sep 1, 2026 12:495,32152,055,63842,617,0001,017,0002,117,632stderr
9Sep 1, 2026 12:4912,531111,105,967101,746,0001,009,0002,117,632stderr