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 listSep 3, 2026 23:20Josu San MartinJosu San MartinScore: 3,311Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 23:203,26436,741,19625,716,0001,052,0002,121,728stderr
2Sep 3, 2026 23:203,28337,712,27125,901,0001,023,0002,121,728stderr
3Sep 3, 2026 23:203,29037,802,66025,957,0001,024,0002,121,728stderr
4Sep 3, 2026 23:203,29337,350,00225,977,0001,029,0002,121,728stderr
5Sep 3, 2026 23:203,31137,136,25526,127,0001,024,0002,121,728stderr
6Sep 3, 2026 23:203,33537,513,08526,318,0001,030,0002,121,728stderr
7Sep 3, 2026 23:2015,447136,686,434125,657,0001,009,0002,121,728stderr
8Sep 3, 2026 23:2015,464136,772,659125,796,0001,015,0002,121,728stderr
9Sep 3, 2026 23:2015,509137,946,954126,174,0001,006,0002,121,728stderr