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 listAug 18, 2026 09:18Josu San MartinJosu San MartinScore: 3,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 09:213,78240,993,02828,865,0002,149,0002,113,536
2Aug 18, 2026 09:213,78541,228,89028,855,0002,189,0002,113,536
3Aug 18, 2026 09:213,79341,085,25128,923,0002,186,0002,113,536
4Aug 18, 2026 09:213,79641,141,56528,997,0002,136,0002,113,536
5Aug 18, 2026 09:213,82242,104,66429,149,0002,192,0002,113,536
6Aug 18, 2026 09:213,83141,491,19629,219,0002,200,0002,113,536
7Aug 18, 2026 09:213,83741,530,44129,319,0002,148,0002,113,536
8Aug 18, 2026 09:213,85242,446,34129,514,0002,077,0002,113,536
9Aug 18, 2026 09:213,85541,606,12529,449,0002,162,0002,113,536