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:01M-RochatM-RochatScore: 21,832Success
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:029,52687,412,80072,651,0005,468,0002,113,536
2May 17, 2026 04:029,72789,130,55374,331,0005,435,0002,113,536
3May 17, 2026 04:029,75688,815,63574,767,0005,236,0002,113,536
4May 17, 2026 04:0221,733188,127,406171,774,0006,442,0002,117,632
5May 17, 2026 04:0221,832187,846,139172,534,0006,491,0002,117,632
6May 17, 2026 04:0221,847190,838,897172,610,0006,541,0002,117,632
7May 17, 2026 04:0221,891188,311,280172,896,0006,611,0002,117,632
8May 17, 2026 04:0221,960188,790,147173,670,0006,408,0002,117,632
9May 17, 2026 04:0222,000189,228,157173,911,0006,492,0002,117,632