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 12:48Victor MerckléVictor MerckléScore: 5,373Success
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 12:492,57634,509,94820,103,0001,027,00024,576stderr
2Sep 8, 2026 12:492,63334,959,64521,598,000024,576stderr
3Sep 8, 2026 12:492,63635,763,86721,620,000024,576stderr
4Sep 8, 2026 12:492,64435,163,99821,681,000024,576stderr
5Sep 8, 2026 12:495,37357,530,01743,052,0001,013,00024,576stderr
6Sep 8, 2026 12:495,38457,539,57443,139,0001,015,00024,576stderr
7Sep 8, 2026 12:495,40457,674,37443,303,0001,015,00024,576stderr
8Sep 8, 2026 12:495,45558,118,69143,722,0001,014,00024,576stderr
9Sep 8, 2026 12:495,45758,134,05443,734,0001,014,00024,576stderr