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:41e1011e1011Score: 17,811Success
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:4317,689156,526,319143,040,0002,013,0002,113,536
2Nov 4, 2026 21:4317,708156,563,622143,189,0002,022,0002,113,536
3Nov 4, 2026 21:4317,764157,001,560143,654,0002,012,0002,113,536
4Nov 4, 2026 21:4317,805158,152,148143,994,0002,014,0002,113,536
5Nov 4, 2026 21:4317,811157,374,707144,044,0002,014,0002,113,536
6Nov 4, 2026 21:4317,849157,222,520144,346,0002,018,0002,113,536
7Nov 4, 2026 21:4317,946158,091,101145,146,0002,012,0002,113,536
8Nov 4, 2026 21:4317,999158,409,862145,581,0002,017,0002,113,536
9Nov 4, 2026 21:4318,282160,762,346146,864,0003,053,0002,113,536