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 15:32Victor MerckléVictor MerckléScore: 2,651Success
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 15:332,61729,823,17021,466,000024,576stderr
2Sep 8, 2026 15:332,64130,165,08521,661,000024,576stderr
3Sep 8, 2026 15:332,64729,921,64021,709,000024,576stderr
4Sep 8, 2026 15:332,64829,983,68921,717,000024,576stderr
5Sep 8, 2026 15:332,65129,990,43021,744,000024,576stderr
6Sep 8, 2026 15:332,67030,352,01021,902,000024,576stderr
7Sep 8, 2026 15:332,67531,068,28621,939,000024,576stderr
8Sep 8, 2026 15:335,50153,340,82744,099,0001,013,00024,576stderr
9Sep 8, 2026 15:3311,439101,973,38992,786,0001,014,00024,576stderr