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:34Victor MerckléVictor MerckléScore: 5,475Success
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:352,80531,375,96121,948,0001,060,0002,117,632stderr
2Sep 1, 2026 10:352,81031,403,40421,975,0001,069,0002,117,632stderr
3Sep 1, 2026 10:352,81431,425,83622,023,0001,055,0002,117,632stderr
4Sep 1, 2026 10:352,82032,186,01122,033,0001,092,0002,117,632stderr
5Sep 1, 2026 10:355,47553,933,49943,882,0001,015,0002,117,632stderr
6Sep 1, 2026 10:355,49153,421,44444,016,0001,015,0002,117,632stderr
7Sep 1, 2026 10:355,50753,519,05344,147,0001,014,0002,117,632stderr
8Sep 1, 2026 10:355,51653,621,79944,222,0001,017,0002,117,632stderr
9Sep 1, 2026 10:355,53553,723,79444,371,0001,017,0002,117,632stderr