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 20:03Victor MerckléVictor MerckléScore: 2,638Success
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 20:042,55129,437,27820,924,000024,576stderr
2Sep 8, 2026 20:042,56029,497,40120,998,000024,576stderr
3Sep 8, 2026 20:042,56729,527,89621,056,000024,576stderr
4Sep 8, 2026 20:042,62830,136,23721,556,000024,576stderr
5Sep 8, 2026 20:042,63831,492,41121,637,000024,576stderr
6Sep 8, 2026 20:042,63930,710,94521,644,000024,576stderr
7Sep 8, 2026 20:042,67031,085,23521,902,000024,576stderr
8Sep 8, 2026 20:045,51353,753,77444,193,0001,014,00024,576stderr
9Sep 8, 2026 20:0411,509102,804,04292,315,0002,061,00024,576stderr