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:17Pavel SkripkinPavel SkripkinScore: 4,280Success
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:184,12241,140,47830,215,0003,590,0002,117,632
2May 11, 2026 18:184,16841,526,50730,585,0003,593,0002,117,632
3May 11, 2026 18:184,17943,999,86030,996,0003,272,0002,117,632
4May 11, 2026 18:184,27145,909,64330,828,0004,195,0002,117,632
5May 11, 2026 18:184,28044,397,21132,017,0003,084,0002,117,632
6May 11, 2026 18:184,33044,914,65731,410,0004,098,0002,117,632
7May 11, 2026 18:1824,464208,115,201197,025,0003,587,0002,117,632
8May 11, 2026 18:1825,515219,619,094206,179,0003,051,0002,117,632
9May 11, 2026 18:1825,837219,203,526208,587,0003,282,0002,117,632