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 15:00Victor MerckléVictor MerckléScore: 2,849Success
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 15:022,77931,040,34422,790,000024,576stderr
2Sep 8, 2026 15:022,82331,436,35823,153,000024,576stderr
3Sep 8, 2026 15:022,82439,581,63623,163,000024,576stderr
4Sep 8, 2026 15:022,84631,726,23422,312,0001,026,00024,576stderr
5Sep 8, 2026 15:022,84937,016,20623,365,000024,576stderr
6Sep 8, 2026 15:022,86531,690,96523,498,000024,576stderr
7Sep 8, 2026 15:022,86731,690,19023,513,000024,576stderr
8Sep 8, 2026 15:025,68254,767,33845,584,0001,013,00024,576stderr
9Sep 8, 2026 15:025,88964,722,89947,279,0001,014,00024,576stderr