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 14, 2026 02:33Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:20Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:20036,370,62725,317,0001,167,0002,117,632expected "0 ", got "2147483648 "stderr
2Jul 5, 2026 13:20035,851,86725,277,0001,149,0002,117,632expected "0 ", got "2147483648 "stderr
3Jul 5, 2026 13:20035,945,11825,352,0001,171,0002,117,632expected "0 ", got "2147483648 "stderr
4Apr 14, 2026 02:333,59951,972,08229,510,00002,338,816
5Apr 14, 2026 02:333,62363,042,18529,712,00002,482,176
6Apr 14, 2026 02:333,64361,925,42627,883,0001,991,0002,424,832