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 18, 2026 15:18Maya RebholzMaya RebholzScore: 14,964Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 15:2114,327126,710,657116,479,0001,010,0002,113,536
2Jun 18, 2026 15:2114,408127,387,257117,137,0001,015,0002,113,536
3Jun 18, 2026 15:2114,508128,227,719117,960,0001,011,0002,113,536
4Jun 18, 2026 15:2114,912131,525,446121,267,0001,018,0002,113,536
5Jun 18, 2026 15:2114,964132,350,937121,686,0001,026,0002,113,536
6Jun 18, 2026 15:2114,993132,206,631121,936,0001,012,0002,113,536
7Jun 18, 2026 15:2115,024132,408,860122,195,0001,009,0002,113,536
8Jun 18, 2026 15:2115,139133,406,488123,046,0001,098,0002,113,536
9Jun 18, 2026 15:2115,342135,029,934124,800,0001,011,0002,113,536