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 listNov 4, 2026 21:58e1011e1011Score: 14,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 21:5914,146127,427,000113,972,0002,026,0002,113,536
2Nov 4, 2026 21:5914,153127,462,337113,855,0002,201,0002,113,536
3Nov 4, 2026 21:5914,184127,198,408114,293,0002,016,0002,113,536
4Nov 4, 2026 21:5914,212127,449,669114,531,0002,015,0002,113,536
5Nov 4, 2026 21:5914,213127,969,017114,535,0002,016,0002,113,536
6Nov 4, 2026 21:5914,243128,216,831114,776,0002,017,0002,113,536
7Nov 4, 2026 21:5914,250128,230,645114,825,0002,028,0002,113,536
8Nov 4, 2026 21:5914,298128,234,629115,228,0002,016,0002,113,536
9Nov 4, 2026 21:5914,334135,182,422115,517,0002,023,0002,113,536