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:01Kevin HeaveyKevin HeaveyScore: 2,565Success
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:022,55129,615,27119,916,0001,003,00020,480
2Sep 24, 2026 08:022,55729,586,93419,942,0001,029,00020,480
3Sep 24, 2026 08:022,56229,701,70219,983,0001,026,00020,480
4Sep 24, 2026 08:022,56230,325,27620,002,0001,009,00020,480
5Sep 24, 2026 08:022,56530,342,61720,000,0001,039,00020,480
6Sep 24, 2026 08:022,56630,373,01820,038,0001,009,00020,480
7Sep 24, 2026 08:022,57330,499,27419,986,0001,115,00020,480
8Sep 24, 2026 08:027,66372,226,36760,810,0002,027,00020,480
9Sep 24, 2026 08:027,77773,136,96661,747,0002,032,00020,480