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 5, 2026 04:17e1011e1011Score: 22,899Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2026 04:1822,813197,958,663185,063,0002,011,0002,113,536
2Nov 5, 2026 04:1822,822198,070,257185,131,0002,013,0002,113,536
3Nov 5, 2026 04:1822,859198,377,609185,437,0002,010,0002,113,536
4Nov 5, 2026 04:1822,896198,537,389185,738,0002,010,0002,113,536
5Nov 5, 2026 04:1822,899199,220,910185,765,0002,010,0002,113,536
6Nov 5, 2026 04:1822,936198,973,837186,072,0002,010,0002,113,536
7Nov 5, 2026 04:1822,948199,105,827186,166,0002,012,0002,113,536
8Nov 5, 2026 04:1823,033199,844,590186,864,0002,013,0002,113,536
9Nov 5, 2026 04:1823,129200,592,325186,643,0003,019,0002,113,536