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 10:59Victor MerckléVictor MerckléScore: 2,915Success
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 11:002,87131,357,01922,407,0001,140,0002,117,632stderr
2Jul 7, 2026 11:002,88432,194,47222,539,0001,114,0002,117,632stderr
3Jul 7, 2026 11:002,89731,549,95622,639,0001,123,0002,117,632stderr
4Jul 7, 2026 11:002,90131,547,66322,769,0001,022,0002,117,632stderr
5Jul 7, 2026 11:002,91531,712,27622,883,0001,025,0002,117,632stderr
6Jul 7, 2026 11:002,93431,974,05122,900,0001,159,0002,117,632stderr
7Jul 7, 2026 11:0011,768104,317,68595,400,0001,102,0002,117,632stderr
8Jul 7, 2026 11:0011,774106,008,87495,424,0001,126,0002,117,632stderr
9Jul 7, 2026 11:0012,422109,815,651100,732,0001,136,0002,117,632stderr