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:02M-RochatM-RochatScore: 10,887Success
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:0410,71696,643,52280,457,0007,415,0002,113,536
2May 17, 2026 04:0410,80599,947,77581,077,0007,527,0002,113,536
3May 17, 2026 04:0410,81397,522,55981,522,0007,151,0002,113,536
4May 17, 2026 04:0410,834100,690,96581,413,0007,429,0002,113,536
5May 17, 2026 04:0410,88798,679,95481,697,0007,578,0002,113,536
6May 17, 2026 04:0411,00999,055,53382,909,0007,372,0002,113,536
7May 17, 2026 04:0411,033102,159,58783,032,0007,440,0002,113,536
8May 17, 2026 04:0411,03499,275,39783,176,0007,309,0002,113,536
9May 17, 2026 04:0422,887196,427,124179,052,0008,626,0002,117,632