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 listSep 1, 2026 14:23Victor MerckléVictor MerckléScore: 2,637Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 20:10Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 14:242,62629,831,25420,510,0001,025,0002,117,632stderr
2Sep 1, 2026 14:242,62729,947,97920,465,0001,077,0002,117,632stderr
3Sep 1, 2026 14:242,63029,824,63620,561,0001,013,0002,117,632stderr
4Sep 1, 2026 14:242,63429,882,82220,551,0001,055,0002,117,632stderr
5Sep 1, 2026 14:242,63729,916,19520,607,0001,020,0002,117,632stderr
6Sep 1, 2026 14:242,63930,032,30320,612,0001,031,0002,117,632stderr
7Sep 1, 2026 14:245,32852,709,27642,658,0001,032,0002,117,632stderr
8Sep 1, 2026 14:245,33852,057,24042,749,0001,027,0002,117,632stderr
9Sep 1, 2026 14:245,40052,518,04843,243,0001,039,0002,117,632stderr