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:09A_ShamanA_ShamanScore: 38,648Success
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:1037,997320,646,118128,446,000183,131,0002,113,536
2Jun 21, 2026 19:1038,004321,080,741128,403,000183,236,0002,113,536
3Jun 21, 2026 19:1038,162322,381,213130,588,000182,341,0002,113,536
4Jun 21, 2026 19:1038,584325,564,659135,510,000180,886,0002,113,536
5Jun 21, 2026 19:1038,648325,954,712135,598,000181,318,0002,113,536
6Jun 21, 2026 19:1038,684326,380,181135,518,000181,694,0002,113,536
7Jun 21, 2026 19:1038,865327,772,978135,606,000183,091,0002,113,536
8Jun 21, 2026 19:1038,914328,236,418135,741,000183,357,0002,113,536
9Jun 21, 2026 19:1039,249330,966,900135,621,000186,228,0002,113,536