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 2, 2026 13:14Pavel SkripkinPavel SkripkinScore: 16,877Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 2, 2026 13:1415,660148,788,738117,384,00011,036,0002,392,064
2May 2, 2026 13:1415,949145,089,836121,802,0008,985,0002,338,816
3May 2, 2026 13:1416,369149,498,087124,211,00010,017,0002,469,888
4May 2, 2026 13:1416,603153,875,466121,129,00015,016,0002,412,544
5May 2, 2026 13:1416,877150,646,037127,361,00011,031,0002,494,464
6May 2, 2026 13:1417,038159,350,103128,741,00010,977,0002,555,904
7May 2, 2026 13:1417,065153,914,986126,941,00012,994,0002,404,352
8May 2, 2026 13:1417,382159,698,676133,505,0009,034,0002,379,776
9May 2, 2026 13:1417,856168,115,761138,404,0008,023,0002,560,000