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:16A_ShamanA_ShamanScore: 49,824Success
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:1749,149412,148,515219,025,000184,004,0002,113,536
2Jun 21, 2026 19:1749,405414,241,320221,110,000184,012,0002,113,536
3Jun 21, 2026 19:1749,436414,466,485224,994,000180,385,0002,113,536
4Jun 21, 2026 19:1749,566415,678,907222,278,000184,165,0002,113,536
5Jun 21, 2026 19:1749,824419,315,289224,815,000183,748,0002,113,536
6Jun 21, 2026 19:1749,897418,293,018224,336,000184,823,0002,113,536
7Jun 21, 2026 19:1749,960418,906,788227,052,000182,627,0002,113,536
8Jun 21, 2026 19:1750,355422,654,429226,862,000186,052,0002,113,536
9Jun 21, 2026 19:1751,142428,666,825236,064,000183,304,0002,113,536