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 10:51Victor MerckléVictor MerckléScore: 2,637Success
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 10:522,55729,190,20120,973,000024,576stderr
2Sep 8, 2026 10:522,56029,391,83320,996,000024,576stderr
3Sep 8, 2026 10:522,58739,752,08521,218,000024,576stderr
4Sep 8, 2026 10:522,63430,000,61021,599,000024,576stderr
5Sep 8, 2026 10:522,63729,856,16921,625,000024,576stderr
6Sep 8, 2026 10:522,64429,968,90321,684,000024,576stderr
7Sep 8, 2026 10:522,65830,924,07221,797,000024,576stderr
8Sep 8, 2026 10:522,67138,165,65221,903,000024,576stderr
9Sep 8, 2026 10:522,68037,105,72921,976,000024,576stderr