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 11, 2026 18:19Pavel SkripkinPavel SkripkinScore: 25,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 18:214,03940,556,71229,984,0003,138,0002,117,632
2May 11, 2026 18:214,09341,194,74330,177,0003,389,0002,117,632
3May 11, 2026 18:214,12042,969,78530,377,0003,407,0002,117,632
4May 11, 2026 18:214,19841,788,30831,298,0003,129,0002,117,632
5May 11, 2026 18:2125,011214,612,056201,629,0003,469,0002,117,632
6May 11, 2026 18:2125,221214,149,617203,639,0003,177,0002,117,632
7May 11, 2026 18:2125,275214,580,142203,781,0003,478,0002,117,632
8May 11, 2026 18:2125,751219,289,601207,867,0003,295,0002,117,632
9May 11, 2026 18:2125,890222,405,568208,958,0003,347,0002,117,632