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 14:20Victor MerckléVictor MerckléScore: 2,866Success
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 14:212,80531,978,81421,819,0001,189,0002,117,632stderr
2Aug 19, 2026 14:212,85631,749,55422,282,0001,140,0002,117,632stderr
3Aug 19, 2026 14:212,85933,031,89722,272,0001,179,0002,117,632stderr
4Aug 19, 2026 14:212,86231,853,13222,318,0001,156,0002,117,632stderr
5Aug 19, 2026 14:212,86632,554,39922,339,0001,165,0002,117,632stderr
6Aug 19, 2026 14:212,87532,591,15722,427,0001,156,0002,117,632stderr
7Aug 19, 2026 14:212,88532,001,65422,461,0001,204,0002,117,632stderr
8Aug 19, 2026 14:212,89532,741,67122,601,0001,142,0002,117,632stderr
9Aug 19, 2026 14:215,58254,061,13744,758,0001,021,0002,117,632stderr