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 09:00Victor MerckléVictor MerckléScore: 5,397Success
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 09:012,66030,156,17021,815,000024,576stderr
2Sep 8, 2026 09:012,66330,941,99521,837,000024,576stderr
3Sep 8, 2026 09:012,66630,187,76121,868,000024,576stderr
4Sep 8, 2026 09:012,74530,853,06722,513,000024,576stderr
5Sep 8, 2026 09:015,39752,490,20543,246,0001,015,00024,576stderr
6Sep 8, 2026 09:015,43352,941,98443,539,0001,016,00024,576stderr
7Sep 8, 2026 09:015,44752,940,25543,658,0001,014,00024,576stderr
8Sep 8, 2026 09:015,45452,981,90543,710,0001,015,00024,576stderr
9Sep 8, 2026 09:0111,493102,856,79793,240,0001,006,00024,576stderr