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:14Pavel SkripkinPavel SkripkinScore: 4,235Success
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:154,13441,330,87730,818,0003,087,0002,117,632
2May 11, 2026 18:154,16141,458,55731,023,0003,105,0002,117,632
3May 11, 2026 18:154,16143,838,71531,039,0003,089,0002,117,632
4May 11, 2026 18:154,17444,592,84531,020,0003,214,0002,117,632
5May 11, 2026 18:154,23544,189,72330,688,0004,044,0002,117,632
6May 11, 2026 18:154,25042,212,24230,783,0004,073,0002,117,632
7May 11, 2026 18:154,46944,020,64932,013,0004,635,0002,117,632
8May 11, 2026 18:1524,799210,704,190200,175,0003,179,0002,117,632
9May 11, 2026 18:1525,338215,216,965204,670,0003,109,0002,117,632