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 listSep 24, 2026 08:40Kevin HeaveyKevin HeaveyScore: 2,539Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 08:412,53130,142,50820,759,000020,480
2Sep 24, 2026 08:412,53229,335,55620,764,000020,480
3Sep 24, 2026 08:412,53529,323,27119,775,0001,017,00020,480
4Sep 24, 2026 08:412,53529,349,28019,775,0001,020,00020,480
5Sep 24, 2026 08:412,53929,498,81919,814,0001,007,00020,480
6Sep 24, 2026 08:412,54029,806,39419,802,0001,034,00020,480
7Sep 24, 2026 08:412,54431,718,17119,845,0001,022,00020,480
8Sep 24, 2026 08:412,54729,522,06820,892,000020,480
9Sep 24, 2026 08:417,77373,157,76861,722,0002,020,00020,480