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:20Victor MerckléVictor MerckléScore: 2,673Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 20:09Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 14:222,65931,606,05920,757,0001,054,0002,117,632stderr
2Sep 1, 2026 14:222,66331,688,22720,702,0001,136,0002,117,632stderr
3Sep 1, 2026 14:222,66631,657,28920,729,0001,133,0002,117,632stderr
4Sep 1, 2026 14:222,66831,817,17520,699,0001,184,0002,117,632stderr
5Sep 1, 2026 14:222,67331,686,00920,763,0001,159,0002,117,632stderr
6Sep 1, 2026 14:222,68032,469,20220,817,0001,159,0002,117,632stderr
7Sep 1, 2026 14:222,68231,797,84220,698,0001,298,0002,117,632stderr
8Sep 1, 2026 14:225,31853,377,00442,593,0001,019,0002,117,632stderr
9Sep 1, 2026 14:225,35553,692,85742,887,0001,028,0002,117,632stderr