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 13:26Pavel SkripkinPavel SkripkinScore: 25,155Success
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 13:294,06141,292,62429,873,0003,430,0002,117,632
2May 10, 2026 13:294,09040,785,63630,478,0003,068,0002,117,632
3May 10, 2026 13:294,09942,778,36430,134,0003,478,0002,117,632
4May 10, 2026 13:294,23244,169,69931,625,0003,081,0002,117,632
5May 10, 2026 13:2925,155213,698,355201,714,0004,561,0002,117,632
6May 10, 2026 13:2925,361215,504,188204,785,0003,179,0002,117,632
7May 10, 2026 13:2925,410218,117,545204,360,0004,002,0002,117,632
8May 10, 2026 13:2925,477220,068,012205,706,0003,212,0002,117,632
9May 10, 2026 13:2926,026221,354,251210,214,0003,200,0002,117,632