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 15, 2026 00:42zielajzielajScore: 5,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 00:432,69530,364,81320,931,0001,173,0002,117,632stderr
2May 15, 2026 00:432,71130,551,03920,959,0001,275,0002,117,632stderr
3May 15, 2026 00:435,12350,161,74740,995,0001,016,0002,117,632stderr
4May 15, 2026 00:435,13549,516,79441,088,0001,026,0002,117,632stderr
5May 15, 2026 00:435,13551,992,85041,089,0001,019,0002,117,632stderr
6May 15, 2026 00:435,13951,420,82541,106,0001,036,0002,117,632stderr
7May 15, 2026 00:435,14151,403,34641,145,0001,018,0002,117,632stderr
8May 15, 2026 00:435,15049,599,37641,196,0001,034,0002,117,632stderr
9May 15, 2026 00:435,15749,572,80541,255,0001,033,0002,117,632stderr