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 listMar 20, 2026 03:29olliecrowolliecrowScore: 17,642Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 03:293,35853,078,25426,513,0001,019,0002,494,464
2Mar 20, 2026 03:2917,642169,373,973140,676,0003,990,0002,396,160
3Mar 20, 2026 03:2917,648169,641,333142,719,0001,996,0002,285,568