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 listApr 30, 2026 09:06Victor MerckléVictor MerckléScore: 36,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 09:0735,948318,345,881290,784,0003,997,0002,543,616
2Apr 30, 2026 09:0736,068313,877,893292,768,0002,997,0002,560,000
3Apr 30, 2026 09:0736,196315,325,151293,813,0002,998,0002,494,464
4Apr 30, 2026 09:0736,276319,206,684293,474,0003,992,0002,539,520
5Apr 30, 2026 09:0736,284315,134,202294,536,0002,995,0002,428,928
6Apr 30, 2026 09:0736,294314,820,585294,618,0002,996,0002,342,912
7Apr 30, 2026 09:0736,299313,157,285294,656,0002,996,0002,379,776
8Apr 30, 2026 09:0736,586321,148,069299,006,0001,000,0002,449,408
9Apr 30, 2026 09:0737,596327,916,924305,290,0003,002,0002,433,024