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 1, 2026 16:36Pavel SkripkinPavel SkripkinScore: 22,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 16:3621,668193,887,263175,685,0001,996,0002,564,096
2May 1, 2026 16:3622,160197,881,774178,721,0002,995,0002,306,048
3May 1, 2026 16:3622,189195,142,117179,954,0001,999,0002,568,192
4May 1, 2026 16:3622,217200,914,594181,185,0001,001,0002,306,048
5May 1, 2026 16:3622,414198,085,736181,802,0001,997,0002,306,048
6May 1, 2026 16:3622,431206,867,804180,937,0002,998,0002,306,048
7May 1, 2026 16:3622,438202,022,143181,995,0001,999,0002,555,904
8May 1, 2026 16:3622,443202,525,921183,038,0001,000,0002,306,048
9May 1, 2026 16:3622,506198,616,912183,550,0001,003,0002,330,624