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 04:19e1011e1011Score: 19,728Success
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 04:2019,666172,700,868159,255,0002,014,0002,113,536
2Nov 5, 2026 04:2019,714172,530,567159,643,0002,012,0002,113,536
3Nov 5, 2026 04:2019,715172,612,459159,655,0002,010,0002,113,536
4Nov 5, 2026 04:2019,723173,155,444159,723,0002,010,0002,113,536
5Nov 5, 2026 04:2019,728172,633,303159,760,0002,010,0002,113,536
6Nov 5, 2026 04:2019,738173,320,209159,837,0002,022,0002,113,536
7Nov 5, 2026 04:2019,800174,011,770160,348,0002,014,0002,113,536
8Nov 5, 2026 04:2019,807173,373,672160,400,0002,021,0002,113,536
9Nov 5, 2026 04:2019,824173,416,696160,544,0002,013,0002,113,536