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 listJun 18, 2026 15:32Maya RebholzMaya RebholzScore: 13,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 15:3612,760114,059,427100,146,0004,491,0002,113,536
2Jun 18, 2026 15:3613,013116,372,551101,991,0004,720,0002,113,536
3Jun 18, 2026 15:3613,680121,447,338107,578,0004,600,0002,113,536
4Jun 18, 2026 15:3613,770122,126,671108,266,0004,653,0002,113,536
5Jun 18, 2026 15:3613,873122,969,000109,023,0004,740,0002,113,536
6Jun 18, 2026 15:3613,952124,005,933109,527,0004,881,0002,113,536
7Jun 18, 2026 15:3614,054124,437,263110,514,0004,734,0002,113,536
8Jun 18, 2026 15:3614,317126,672,165112,068,0005,334,0002,113,536
9Jun 18, 2026 15:3692,395767,476,666698,078,00059,562,0002,113,536