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 listAug 23, 2026 18:59Victor MerckléVictor MerckléScore: 5,444Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 19:002,75730,803,94121,501,0001,114,0002,129,920stderr
2Aug 23, 2026 19:002,77531,035,95521,723,0001,035,0002,138,112stderr
3Aug 23, 2026 19:002,78231,077,83321,595,0001,222,0002,138,112stderr
4Aug 23, 2026 19:005,42352,543,13943,423,0001,049,0002,129,920stderr
5Aug 23, 2026 19:005,44453,806,49443,493,0001,154,0002,129,920stderr
6Aug 23, 2026 19:005,47253,035,42543,733,0001,144,0002,129,920stderr
7Aug 23, 2026 19:005,47653,900,98543,737,0001,169,0002,138,112stderr
8Aug 23, 2026 19:005,58753,945,78444,802,0001,017,0002,129,920stderr
9Aug 23, 2026 19:0014,161124,403,581115,049,0001,073,0002,129,920stderr