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 listJun 16, 2026 20:19Maya RebholzMaya RebholzScore: 48,868Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 20:2347,470398,919,373362,850,00026,412,0002,199,552
2Jun 16, 2026 20:2348,312405,833,068369,569,00026,595,0002,199,552
3Jun 16, 2026 20:2348,461407,078,031371,104,00026,278,0002,199,552
4Jun 16, 2026 20:2348,864410,413,702373,810,00026,876,0002,199,552
5Jun 16, 2026 20:2348,868409,950,152371,213,00029,510,0002,199,552
6Jun 16, 2026 20:2349,001411,039,401372,098,00029,717,0002,199,552
7Jun 16, 2026 20:2349,141412,251,793375,749,00027,213,0002,199,552
8Jun 16, 2026 20:2349,331414,247,587378,059,00026,463,0002,199,552
9Jun 16, 2026 20:2350,610424,286,840385,653,00029,350,0002,199,552