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 05:54Victor MerckléVictor MerckléScore: 2,600Success
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 05:552,59129,663,47021,251,000024,576stderr
2Sep 8, 2026 05:552,59329,459,82521,263,000024,576stderr
3Sep 8, 2026 05:552,59729,499,44121,296,000024,576stderr
4Sep 8, 2026 05:552,59929,694,64921,319,000024,576stderr
5Sep 8, 2026 05:552,60029,650,82221,322,000024,576stderr
6Sep 8, 2026 05:552,60529,621,07521,361,000024,576stderr
7Sep 8, 2026 05:552,60830,732,81521,393,000024,576stderr
8Sep 8, 2026 05:552,60829,605,57721,390,000024,576stderr
9Sep 8, 2026 05:552,61030,256,23621,403,000024,576stderr