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 listAug 18, 2026 14:02Victor MerckléVictor MerckléScore: 3,187Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 14:043,09733,792,74024,349,0001,052,0002,142,208stderr
2Aug 18, 2026 14:043,11533,911,09824,490,0001,053,0002,142,208stderr
3Aug 18, 2026 14:043,13935,698,36323,629,0002,116,0002,142,208stderr
4Aug 18, 2026 14:043,14334,080,16123,650,0002,129,0002,142,208stderr
5Aug 18, 2026 14:043,18734,642,75924,084,0002,053,0002,142,208stderr
6Aug 18, 2026 14:043,19234,635,29125,123,0001,058,0002,142,208stderr
7Aug 18, 2026 14:043,22634,934,75724,415,0002,039,0002,142,208stderr
8Aug 18, 2026 14:0412,637112,696,454101,525,0002,102,0002,142,208stderr
9Aug 18, 2026 14:0412,652112,233,370101,616,0002,131,0002,142,208stderr