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:35e1011e1011Score: 17,941Success
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:3717,785157,251,576143,735,0002,102,0002,113,536
2Nov 4, 2026 21:3717,837157,649,530144,257,0002,010,0002,113,536
3Nov 4, 2026 21:3717,874157,474,355144,556,0002,013,0002,113,536
4Nov 4, 2026 21:3717,919157,848,014144,925,0002,012,0002,113,536
5Nov 4, 2026 21:3717,941157,850,443145,106,0002,011,0002,113,536
6Nov 4, 2026 21:3717,976158,179,211145,396,0002,011,0002,113,536
7Nov 4, 2026 21:3717,983158,928,125145,450,0002,015,0002,113,536
8Nov 4, 2026 21:3717,985158,294,791145,469,0002,012,0002,113,536
9Nov 4, 2026 21:3718,031158,707,457145,822,0002,034,0002,113,536