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 listJul 10, 2026 18:23Genos0Genos0Score: 1,001,318Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 18:28998,9848,201,534,5908,040,629,000151,044,0002,113,536
2Jul 10, 2026 18:281,001,3188,220,692,3318,059,572,000151,240,0002,113,536
3Jul 10, 2026 18:281,002,8728,233,626,6358,074,489,000149,067,0002,113,536