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 17, 2026 16:16Maya RebholzMaya RebholzScore: 11,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 16:1710,46495,515,02084,779,0001,028,0002,113,536
2Jun 17, 2026 16:1710,46995,114,02684,829,0001,018,0002,113,536
3Jun 17, 2026 16:1711,147100,706,66590,384,0001,023,0002,113,536
4Jun 17, 2026 16:1711,255109,113,08991,252,0001,044,0002,113,536
5Jun 17, 2026 16:1711,291102,316,43391,572,0001,016,0002,113,536
6Jun 17, 2026 16:1711,299102,300,65291,619,0001,034,0002,113,536
7Jun 17, 2026 16:1711,361111,122,97792,108,0001,058,0002,113,536
8Jun 17, 2026 16:1711,381102,973,18192,292,0001,033,0002,113,536
9Jun 17, 2026 16:1711,425112,468,68092,606,0001,081,0002,113,536