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 03:04Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:46Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:46033,536,01523,111,0001,074,0002,117,632expected "0 ", got "2147483648 "stderr
2Jul 5, 2026 13:46033,506,74723,010,0001,074,0002,117,632expected "0 ", got "2147483648 "stderr
3Jul 5, 2026 13:46033,678,41823,185,0001,097,0002,117,632expected "0 ", got "2147483648 "stderr
4Apr 14, 2026 03:043,94660,241,53227,305,0005,056,0002,322,432
5Apr 14, 2026 03:043,97257,705,37329,516,0003,053,0002,334,720
6Apr 14, 2026 03:044,03763,106,68730,091,0003,009,0002,510,848