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 18:18Victor MerckléVictor MerckléScore: 2,568Success
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 18:202,54730,570,48520,890,000024,576stderr
2Sep 8, 2026 18:202,55229,554,88020,928,000024,576stderr
3Sep 8, 2026 18:202,55429,400,18320,944,000024,576stderr
4Sep 8, 2026 18:202,55829,528,51320,983,000024,576stderr
5Sep 8, 2026 18:202,56829,516,13421,062,000024,576stderr
6Sep 8, 2026 18:202,57029,547,61420,054,0001,024,00024,576stderr
7Sep 8, 2026 18:202,62829,818,25921,557,000024,576stderr
8Sep 8, 2026 18:202,63730,822,63621,626,000024,576stderr
9Sep 8, 2026 18:202,63830,110,99721,639,000024,576stderr