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 08:52Pavel SkripkinPavel SkripkinScore: 25,077Success
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 08:534,21648,802,01131,065,0003,508,0002,334,720
2May 10, 2026 08:534,22750,032,70331,459,0003,209,0002,494,464
3May 10, 2026 08:5324,883219,157,534200,509,0003,537,0002,543,616
4May 10, 2026 08:5324,961218,366,573201,517,0003,170,0002,400,256
5May 10, 2026 08:5325,077221,839,308202,530,0003,105,0002,560,000
6May 10, 2026 08:5325,155220,424,233202,790,0003,486,0002,486,272
7May 10, 2026 08:5325,191219,016,245203,342,0003,226,0002,564,096
8May 10, 2026 08:5325,226222,615,083203,723,0003,135,0002,494,464
9May 10, 2026 08:5325,671225,333,220207,375,0003,134,0002,441,216