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 7, 2026 12:21Victor MerckléVictor MerckléScore: 2,890Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 12:212,85431,427,57222,373,0001,035,0002,117,632stderr
2Jul 7, 2026 12:212,85731,831,37522,409,0001,022,0002,117,632stderr
3Jul 7, 2026 12:212,87831,696,81122,572,0001,029,0002,117,632stderr
4Jul 7, 2026 12:212,88632,106,44122,640,0001,031,0002,117,632stderr
5Jul 7, 2026 12:212,89031,716,27022,676,0001,025,0002,117,632stderr
6Jul 7, 2026 12:212,90731,867,70622,802,0001,038,0002,117,632stderr
7Jul 7, 2026 12:2111,738104,302,51395,129,0001,127,0002,117,632stderr
8Jul 7, 2026 12:2111,760105,932,83395,287,0001,147,0002,117,632stderr
9Jul 7, 2026 12:2112,127107,416,44798,306,0001,136,0002,117,632stderr