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 listMay 10, 2026 10:16Pavel SkripkinPavel SkripkinScore: 24,178Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:174,14749,009,97930,648,0003,364,0002,547,712
2May 10, 2026 10:174,26152,242,94731,703,0003,245,0002,400,256
3May 10, 2026 10:174,26951,010,24131,718,0003,292,0002,445,312
4May 10, 2026 10:174,31250,535,27132,050,0003,316,0002,523,136
5May 10, 2026 10:1724,178210,479,395194,817,0003,443,0002,449,408
6May 10, 2026 10:1725,101219,268,689202,469,0003,360,0002,433,024
7May 10, 2026 10:1725,165221,596,027203,312,0003,048,0002,396,160
8May 10, 2026 10:1725,815228,403,049208,322,0003,363,0002,551,808
9May 10, 2026 10:1725,953227,780,870209,794,0003,027,0002,334,720