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: 16,747Success
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:3216,670147,750,378134,683,0002,013,0002,113,536
2Nov 5, 2026 01:3216,683148,202,796134,778,0002,023,0002,113,536
3Nov 5, 2026 01:3216,694147,710,028134,734,0002,159,0002,113,536
4Nov 5, 2026 01:3216,695147,872,091134,891,0002,011,0002,113,536
5Nov 5, 2026 01:3216,747148,218,359135,319,0002,013,0002,113,536
6Nov 5, 2026 01:3216,757149,183,910135,282,0002,126,0002,113,536
7Nov 5, 2026 01:3216,762148,337,842135,438,0002,013,0002,113,536
8Nov 5, 2026 01:3216,810148,927,952135,828,0002,014,0002,113,536
9Nov 5, 2026 01:3216,834150,885,945136,026,0002,016,0002,113,536