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 listOct 19, 2024 19:40zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:19Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:2008,778,0321,064,000020,480No answer to stdout. Died or killed?
2Oct 19, 2024 19:412,97744,457,07622,381,0002,034,0002,330,624
3Oct 19, 2024 19:412,99545,814,21023,532,0001,023,0002,273,280
4Oct 19, 2024 19:402,99645,704,77622,518,0002,047,0002,506,752
5Oct 19, 2024 19:403,02651,040,32623,824,000992,0002,359,296
6Oct 19, 2024 19:413,03246,774,33823,868,000994,0002,404,352
7Oct 19, 2024 19:403,03348,133,22922,880,0001,989,0002,355,200