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 listMay 11, 2026 18:22Pavel SkripkinPavel SkripkinScore: 25,296Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 18:224,03540,419,77129,894,0003,199,0002,117,632
2May 11, 2026 18:224,11742,080,22030,418,0003,347,0002,117,632
3May 11, 2026 18:2224,670212,492,989199,213,0003,089,0002,117,632
4May 11, 2026 18:2224,802213,689,777200,346,0003,037,0002,117,632
5May 11, 2026 18:2225,296216,582,592204,054,0003,377,0002,117,632
6May 11, 2026 18:2225,485218,176,416205,865,0003,117,0002,117,632
7May 11, 2026 18:2225,558218,956,289206,472,0003,109,0002,117,632
8May 11, 2026 18:2225,733218,310,944207,947,0003,071,0002,117,632
9May 11, 2026 18:2225,923222,081,180209,415,0003,160,0002,117,632