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 listFeb 7, 2026 04:29Josu San MartinJosu San MartinScore: 5,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 04:295,18764,806,21541,520,0001,012,0002,498,560
2Feb 7, 2026 04:295,24567,133,19341,011,0002,000,0002,342,912
3Feb 7, 2026 04:2912,780128,673,120101,800,0002,994,0002,367,488