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 21, 2026 09:26Dominique GarmierDominique GarmierScore: 119,146Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 09:26119,033998,058,684975,068,0001,000,0002,514,944
2Mar 21, 2026 09:26119,1461,007,362,908976,001,0001,000,0002,514,944
3Mar 21, 2026 09:26119,5881,008,452,653979,626,000999,0002,510,848