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 9, 2026 19:10Josu San MartinJosu San MartinScore: 28,312Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 19:1227,436232,008,114223,921,0001,058,0002,469,888
2May 9, 2026 19:1228,138237,513,599229,640,0001,097,0002,465,792
3May 9, 2026 19:1228,283239,902,937230,872,0001,051,0002,469,888
4May 9, 2026 19:1228,296238,586,090230,951,0001,080,0002,469,888
5May 9, 2026 19:1228,312238,895,117231,049,0001,114,0002,453,504
6May 9, 2026 19:1228,328239,065,648231,152,0001,138,0002,469,888
7May 9, 2026 19:1228,334239,039,609231,266,0001,073,0002,457,600
8May 9, 2026 19:1228,689241,870,603234,173,0001,078,0002,453,504
9May 9, 2026 19:1229,091246,667,599237,435,0001,117,0002,457,600