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:29Victor MerckléVictor MerckléScore: 5,410Success
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:302,72730,551,25821,243,0001,119,0002,117,632stderr
2Sep 1, 2026 10:302,73030,762,54921,336,0001,057,0002,117,632stderr
3Sep 1, 2026 10:302,74030,594,43121,428,0001,046,0002,117,632stderr
4Sep 1, 2026 10:305,39252,832,65943,204,0001,012,0002,117,632stderr
5Sep 1, 2026 10:305,41052,574,24343,354,0001,016,0002,117,632stderr
6Sep 1, 2026 10:305,43052,712,98643,517,0001,017,0002,117,632stderr
7Sep 1, 2026 10:305,43553,698,42743,559,0001,014,0002,117,632stderr
8Sep 1, 2026 10:305,48053,172,21843,912,0001,028,0002,117,632stderr
9Sep 1, 2026 10:305,49353,201,74044,019,0001,031,0002,117,632stderr