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:07Pavel SkripkinPavel SkripkinScore: 25,454Success
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:084,12141,264,37130,614,0003,183,0002,117,632
2May 11, 2026 18:084,13242,053,88430,729,0003,159,0002,117,632
3May 11, 2026 18:084,19742,649,19930,400,0004,022,0002,117,632
4May 11, 2026 18:0825,417217,783,454205,254,0003,171,0002,117,632
5May 11, 2026 18:0825,454218,789,439205,507,0003,218,0002,117,632
6May 11, 2026 18:0825,497221,122,980205,971,0003,105,0002,117,632
7May 11, 2026 18:0825,574219,122,943206,699,0003,014,0002,117,632
8May 11, 2026 18:0825,649218,012,174206,023,0004,303,0002,117,632
9May 11, 2026 18:0825,781220,834,532207,309,0004,097,0002,117,632