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:11A_ShamanA_ShamanScore: 37,626Success
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:1237,415315,912,728125,354,000181,454,0002,113,536
2Jun 21, 2026 19:1237,557317,068,204125,955,000182,013,0002,113,536
3Jun 21, 2026 19:1237,595317,445,243127,334,000180,950,0002,113,536
4Jun 21, 2026 19:1237,608317,977,535126,612,000181,774,0002,113,536
5Jun 21, 2026 19:1237,626317,735,278126,952,000181,588,0002,113,536
6Jun 21, 2026 19:1237,702318,324,630129,388,000179,771,0002,113,536
7Jun 21, 2026 19:1237,905321,187,279128,446,000182,382,0002,113,536
8Jun 21, 2026 19:1238,355323,724,036127,173,000187,344,0002,113,536
9Jun 21, 2026 19:1238,812327,336,922131,959,000186,302,0002,113,536