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 9, 2026 07:58Pavel SkripkinPavel SkripkinScore: 5,593Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 07:585,48657,192,37936,708,0008,282,0002,555,904
2May 9, 2026 07:585,49461,644,54336,891,0008,163,0002,564,096
3May 9, 2026 07:585,54458,864,81737,108,0008,360,0002,547,712
4May 9, 2026 07:585,55260,598,34337,221,0008,307,0002,469,888
5May 9, 2026 07:585,59363,379,60737,167,0008,697,0002,486,272
6May 9, 2026 07:585,77263,958,05338,250,0009,086,0002,482,176
7May 9, 2026 07:585,78360,420,33638,098,0009,329,0002,306,048
8May 9, 2026 07:585,79664,202,53838,214,0009,318,0002,306,048
9May 9, 2026 07:585,83063,387,98238,386,0009,425,0002,502,656