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 listJul 9, 2026 06:53Victor MerckléVictor MerckléScore: 2,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 06:542,88531,672,69322,563,0001,100,0002,117,632stderr
2Jul 9, 2026 06:542,89531,865,52222,735,0001,010,0002,117,632stderr
3Jul 9, 2026 06:542,89831,750,19422,656,0001,110,0002,117,632stderr
4Jul 9, 2026 06:542,90331,779,94722,703,0001,105,0002,117,632stderr
5Jul 9, 2026 06:542,90531,858,34622,718,0001,108,0002,117,632stderr
6Jul 9, 2026 06:543,03433,414,44723,743,0001,137,0002,117,632stderr
7Jul 9, 2026 06:543,09833,560,37124,183,0001,228,0002,117,632stderr
8Jul 9, 2026 06:5411,700104,383,57594,797,0001,148,0002,117,632stderr
9Jul 9, 2026 06:5411,786104,647,81695,520,0001,127,0002,117,632stderr