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:16Victor MerckléVictor MerckléScore: 5,363Success
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:172,56537,276,92921,033,000024,576stderr
2Sep 8, 2026 15:172,63530,569,09521,611,000024,576stderr
3Sep 8, 2026 15:172,64229,931,80421,667,000024,576stderr
4Sep 8, 2026 15:172,67838,197,59521,962,000024,576stderr
5Sep 8, 2026 15:175,36352,255,87542,964,0001,014,00024,576stderr
6Sep 8, 2026 15:175,46953,169,59743,832,0001,014,00024,576stderr
7Sep 8, 2026 15:175,47153,124,48543,849,0001,015,00024,576stderr
8Sep 8, 2026 15:175,48253,328,88043,939,0001,015,00024,576stderr
9Sep 8, 2026 15:175,49062,383,95644,008,0001,014,00024,576stderr