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 8, 2026 08:07Victor MerckléVictor MerckléScore: 2,593Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 08:082,58229,410,85121,180,000024,576stderr
2Sep 8, 2026 08:082,59029,629,32721,240,000024,576stderr
3Sep 8, 2026 08:082,59129,492,38621,250,000024,576stderr
4Sep 8, 2026 08:082,59230,371,14921,257,000024,576stderr
5Sep 8, 2026 08:082,59329,622,69221,264,000024,576stderr
6Sep 8, 2026 08:082,60530,455,15121,367,000024,576stderr
7Sep 8, 2026 08:082,63429,964,48720,395,0001,204,00024,576stderr
8Sep 8, 2026 08:082,71632,344,50521,165,0001,111,00024,576stderr
9Sep 8, 2026 08:082,74230,744,30121,116,0001,376,00024,576stderr