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:43Victor MerckléVictor MerckléScore: 2,745Success
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:442,72730,833,67721,301,0001,068,0002,117,632stderr
2Sep 1, 2026 10:442,73130,791,14521,386,0001,014,0002,117,632stderr
3Sep 1, 2026 10:442,73830,910,28021,343,0001,110,0002,117,632stderr
4Sep 1, 2026 10:442,73830,677,04721,367,0001,086,0002,117,632stderr
5Sep 1, 2026 10:442,74530,962,61721,486,0001,025,0002,117,632stderr
6Sep 1, 2026 10:442,74830,707,64221,441,0001,097,0002,117,632stderr
7Sep 1, 2026 10:445,37352,486,76543,053,0001,010,0002,117,632stderr
8Sep 1, 2026 10:445,40252,437,25043,289,0001,013,0002,117,632stderr
9Sep 1, 2026 10:445,64154,668,83544,171,0002,088,0002,117,632stderr