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 02:26M-RochatM-RochatScore: 12,901Success
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 02:2712,449112,656,54096,086,0005,996,0002,113,536
2May 17, 2026 02:2712,584111,955,06597,355,0005,838,0002,113,536
3May 17, 2026 02:2712,636112,357,84797,915,0005,708,0002,113,536
4May 17, 2026 02:2712,657112,671,01298,178,0005,611,0002,113,536
5May 17, 2026 02:2712,901115,964,312100,107,0005,686,0002,113,536
6May 17, 2026 02:2712,917114,705,304100,200,0005,727,0002,113,536
7May 17, 2026 02:2717,465151,974,965137,548,0005,668,0002,117,632
8May 17, 2026 02:2717,594158,215,916137,694,0006,578,0002,117,632
9May 17, 2026 02:2717,856155,401,825139,708,0006,719,0002,117,632