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 21, 2026 19:25A_ShamanA_ShamanScore: 36,342Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 19:2635,750302,317,615113,742,000179,414,0002,113,536
2Jun 21, 2026 19:2635,896303,442,513111,897,000182,455,0002,113,536
3Jun 21, 2026 19:2636,132305,295,782113,141,000183,144,0002,113,536
4Jun 21, 2026 19:2636,269306,458,298112,652,000184,760,0002,113,536
5Jun 21, 2026 19:2636,342307,111,733115,976,000182,034,0002,113,536
6Jun 21, 2026 19:2636,420307,780,779113,093,000185,555,0002,113,536
7Jun 21, 2026 19:2636,673309,856,797114,667,000186,056,0002,113,536
8Jun 21, 2026 19:2636,802310,955,592118,433,000183,346,0002,113,536
9Jun 21, 2026 19:2637,216314,309,429115,477,000189,702,0002,113,536