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 21, 2026 23:39M-RochatM-RochatScore: 18,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 23:406,14259,732,01148,354,0002,015,0002,113,536
2May 21, 2026 23:406,52963,081,72851,532,0002,008,0002,113,536
3May 21, 2026 23:4017,698154,627,292143,118,0002,013,0002,117,632
4May 21, 2026 23:4018,219159,094,600147,389,0002,013,0002,113,536
5May 21, 2026 23:4018,243162,065,083147,584,0002,014,0002,117,632
6May 21, 2026 23:4018,379159,998,932148,702,0002,013,0002,113,536
7May 21, 2026 23:4018,386162,269,574148,754,0002,015,0002,113,536
8May 21, 2026 23:4018,467160,789,650149,422,0002,012,0002,117,632
9May 21, 2026 23:4018,497163,910,712148,677,0003,003,0002,113,536