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:44Maya RebholzMaya RebholzScore: 10,195Success
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:459,79089,555,57378,768,0001,510,0002,113,536
2Jun 18, 2026 15:459,90490,505,50679,714,0001,503,0002,113,536
3Jun 18, 2026 15:459,91590,618,72579,819,0001,485,0002,113,536
4Jun 18, 2026 15:4510,04191,623,70180,839,0001,499,0002,113,536
5Jun 18, 2026 15:4510,19592,850,09482,006,0001,599,0002,113,536
6Jun 18, 2026 15:4510,21493,440,90182,165,0001,596,0002,113,536
7Jun 18, 2026 15:4510,28293,568,42282,741,0001,577,0002,113,536
8Jun 18, 2026 15:4510,36694,195,92183,433,0001,572,0002,113,536
9Jun 18, 2026 15:4510,37494,692,57983,362,0001,709,0002,113,536