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 20, 2026 19:08M-RochatM-RochatScore: 22,296Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 19:0910,26193,620,26377,555,0006,592,0002,113,536
2May 20, 2026 19:0910,29396,725,08377,869,0006,536,0002,113,536
3May 20, 2026 19:0910,40496,407,10078,716,0006,598,0002,113,536
4May 20, 2026 19:0910,83598,431,92282,448,0006,403,0002,113,536
5May 20, 2026 19:0922,296195,139,291175,395,0007,434,0002,117,632
6May 20, 2026 19:0922,421193,326,551176,179,0007,676,0002,117,632
7May 20, 2026 19:0922,528194,170,152177,175,0007,555,0002,117,632
8May 20, 2026 19:0922,562197,155,117177,391,0007,618,0002,117,632
9May 20, 2026 19:0922,656195,578,352178,276,0007,504,0002,117,632