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 01:31e1011e1011Score: 15,962Success
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 01:3515,682140,098,976125,561,0003,037,0002,117,632
2Nov 5, 2026 01:3515,813140,521,457126,663,0003,008,0002,113,536
3Nov 5, 2026 01:3515,921141,439,051127,542,0003,016,0002,113,536
4Nov 5, 2026 01:3515,950144,238,060127,783,0003,007,0002,113,536
5Nov 5, 2026 01:3515,962142,269,903127,869,0003,021,0002,113,536
6Nov 5, 2026 01:3515,970141,886,012127,922,0003,037,0002,113,536
7Nov 5, 2026 01:3516,092142,840,388128,885,0003,070,0002,113,536
8Nov 5, 2026 01:3516,291146,293,449130,459,0003,135,0002,113,536
9Nov 5, 2026 01:3516,431146,149,225131,689,0003,052,0002,113,536