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 20, 2026 18:06A_ShamanA_ShamanScore: 52,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 18:0752,495439,565,461247,175,000183,288,0002,113,536
2Jun 20, 2026 18:0752,567441,445,592251,137,000179,920,0002,113,536
3Jun 20, 2026 18:0752,600440,521,260247,023,000184,301,0002,113,536
4Jun 20, 2026 18:0752,669441,038,358248,797,000183,090,0002,113,536
5Jun 20, 2026 18:0752,722441,487,362253,046,000179,282,0002,113,536
6Jun 20, 2026 18:0752,756441,758,571250,505,000182,096,0002,113,536
7Jun 20, 2026 18:0752,926443,235,616251,354,000182,643,0002,113,536
8Jun 20, 2026 18:0753,026443,991,392249,908,000184,911,0002,113,536
9Jun 20, 2026 18:0754,320454,587,397265,457,000179,975,0002,113,536