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 22:01e1011e1011Score: 16,110Success
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 22:0216,076144,233,970129,811,0002,013,0002,113,536
2Nov 4, 2026 22:0216,077143,234,582129,814,0002,024,0002,113,536
3Nov 4, 2026 22:0216,077142,986,679129,819,0002,017,0002,113,536
4Nov 4, 2026 22:0216,081143,178,124129,854,0002,017,0002,113,536
5Nov 4, 2026 22:0216,110143,013,410130,080,0002,025,0002,113,536
6Nov 4, 2026 22:0216,160143,341,043130,498,0002,014,0002,113,536
7Nov 4, 2026 22:0216,203144,312,955130,852,0002,014,0002,113,536
8Nov 4, 2026 22:0216,261144,136,785131,328,0002,016,0002,113,536
9Nov 4, 2026 22:0216,310145,105,110130,703,0003,047,0002,113,536