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: 12,177Success
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:0311,972108,898,39288,659,0009,513,0002,113,536
2May 17, 2026 04:0312,085107,765,12589,501,0009,597,0002,113,536
3May 17, 2026 04:0312,122109,583,67690,029,0009,372,0002,113,536
4May 17, 2026 04:0312,140108,326,37890,135,0009,414,0002,113,536
5May 17, 2026 04:0312,177108,566,85890,513,0009,342,0002,113,536
6May 17, 2026 04:0312,235109,010,91790,830,0009,501,0002,113,536
7May 17, 2026 04:0323,907206,099,161185,740,00010,304,0002,117,632
8May 17, 2026 04:0324,304208,067,263189,045,00010,255,0002,117,632
9May 17, 2026 04:0324,313208,170,851188,851,00010,522,0002,117,632