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 17, 2026 15:17Maya RebholzMaya RebholzScore: 9,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 15:189,64888,324,14578,105,0001,014,0002,113,536
2Jun 17, 2026 15:189,66588,457,31078,244,0001,014,0002,113,536
3Jun 17, 2026 15:189,67588,969,53178,297,0001,041,0002,113,536
4Jun 17, 2026 15:189,67888,589,30478,349,0001,016,0002,113,536
5Jun 17, 2026 15:189,69989,021,38278,518,0001,020,0002,113,536
6Jun 17, 2026 15:1810,42294,661,19984,449,0001,017,0002,113,536
7Jun 17, 2026 15:1810,44195,211,76884,600,0001,020,0002,113,536
8Jun 17, 2026 15:1810,44894,974,36084,654,0001,020,0002,113,536
9Jun 17, 2026 15:1810,47795,399,73284,901,0001,015,0002,113,536