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:39e1011e1011Score: 17,983Success
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:4217,874157,940,146144,372,0002,201,0002,113,536
2Nov 4, 2026 21:4217,895158,193,794144,729,0002,014,0002,113,536
3Nov 4, 2026 21:4217,934158,415,115145,049,0002,014,0002,113,536
4Nov 4, 2026 21:4217,973158,835,799145,366,0002,018,0002,113,536
5Nov 4, 2026 21:4217,983158,885,505145,449,0002,015,0002,113,536
6Nov 4, 2026 21:4218,015158,595,737145,710,0002,014,0002,113,536
7Nov 4, 2026 21:4218,023159,241,672145,782,0002,013,0002,113,536
8Nov 4, 2026 21:4218,079161,110,802146,236,0002,014,0002,113,536
9Nov 4, 2026 21:4218,231160,420,753146,488,0003,013,0002,113,536