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 1, 2026 16:59Pavel SkripkinPavel SkripkinScore: 12,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 16:5912,103118,469,05196,214,0003,038,0002,408,448
2May 1, 2026 16:5912,123118,500,97198,410,0001,004,0002,318,336
3May 1, 2026 16:5912,136120,012,73699,521,00002,314,240
4May 1, 2026 16:5912,138116,385,36696,517,0003,016,0002,420,736
5May 1, 2026 16:5912,159114,203,28398,699,0001,007,0002,318,336
6May 1, 2026 16:5912,160119,548,06397,720,0001,994,0002,314,240
7May 1, 2026 16:5912,165117,609,02097,763,0001,995,0002,326,528
8May 1, 2026 16:5912,175115,081,62497,840,0001,996,0002,416,640
9May 1, 2026 16:5912,260115,550,43599,531,0001,005,0002,412,544