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 listApr 30, 2026 09:13Victor MerckléVictor MerckléScore: 91,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 09:1491,022763,364,389744,385,0001,998,0002,387,968stderr
2Apr 30, 2026 09:1491,166771,280,289743,572,0003,997,0002,347,008stderr
3Apr 30, 2026 09:1491,270767,191,052744,419,0003,996,0002,318,336stderr
4Apr 30, 2026 09:1491,275767,046,012744,461,0003,997,0002,457,600stderr
5Apr 30, 2026 09:1491,289765,292,188745,578,0002,998,0002,510,848stderr
6Apr 30, 2026 09:1491,308769,041,594745,730,0002,998,0002,551,808stderr
7Apr 30, 2026 09:1491,373767,199,112747,261,0002,000,0002,437,120stderr
8Apr 30, 2026 09:1491,374773,837,730745,271,0003,996,0002,412,544stderr
9Apr 30, 2026 09:1491,595769,187,415747,082,0004,000,0002,506,752stderr