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 17, 2026 04:27M-RochatM-RochatScore: 22,192Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 04:2810,18892,778,07277,164,0006,379,0002,113,536
2May 17, 2026 04:2810,20192,484,23777,104,0006,545,0002,113,536
3May 17, 2026 04:2822,071189,751,857173,472,0007,515,0002,117,632
4May 17, 2026 04:2822,174190,603,005174,575,0007,258,0002,117,632
5May 17, 2026 04:2822,192193,064,573174,550,0007,425,0002,117,632
6May 17, 2026 04:2822,451194,550,827176,613,0007,490,0002,117,632
7May 17, 2026 04:2822,504193,368,378177,005,0007,530,0002,117,632
8May 17, 2026 04:2822,618195,314,343178,264,0007,204,0002,117,632
9May 17, 2026 04:2822,950197,248,457180,839,0007,355,0002,117,632