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 19, 2026 09:47Victor MerckléVictor MerckléScore: 5,431Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 09:482,79531,051,56621,768,0001,154,0002,117,632stderr
2Aug 19, 2026 09:482,85731,751,16822,276,0001,155,0002,117,632stderr
3Aug 19, 2026 09:485,42052,589,30543,419,0001,027,0002,117,632stderr
4Aug 19, 2026 09:485,42152,601,91343,404,0001,050,0002,117,632stderr
5Aug 19, 2026 09:485,43154,819,36943,389,0001,146,0002,117,632stderr
6Aug 19, 2026 09:485,49853,493,13543,930,0001,159,0002,117,632stderr
7Aug 19, 2026 09:485,50453,272,84044,011,0001,129,0002,117,632stderr
8Aug 19, 2026 09:485,52054,296,20844,107,0001,158,0002,117,632stderr
9Aug 19, 2026 09:485,53153,658,22644,197,0001,164,0002,117,632stderr