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 8, 2026 03:43Victor MerckléVictor MerckléScore: 11,696Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 03:442,86631,417,98622,375,0001,131,0002,117,632stderr
2Jul 8, 2026 03:442,91231,872,14522,751,0001,133,0002,117,632stderr
3Jul 8, 2026 03:442,92831,999,83622,985,0001,027,0002,117,632stderr
4Jul 8, 2026 03:4411,695104,069,99294,770,0001,134,0002,117,632stderr
5Jul 8, 2026 03:4411,696104,026,10594,777,0001,133,0002,117,632stderr
6Jul 8, 2026 03:4411,707104,077,75694,915,0001,088,0002,117,632stderr
7Jul 8, 2026 03:4411,718104,215,37995,056,0001,036,0002,117,632stderr
8Jul 8, 2026 03:4411,738104,195,96595,199,0001,057,0002,117,632stderr
9Jul 8, 2026 03:4411,788104,648,86795,519,0001,146,0002,117,632stderr