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 16, 2024 22:52zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:49Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:49011,430,2202,339,000020,480No answer to stdout. Died or killed?
2Oct 16, 2024 22:523,45151,546,37625,265,0003,031,0002,506,752
3Oct 16, 2024 22:523,45547,625,20226,304,0002,023,0002,433,024
4Oct 16, 2024 22:523,46750,331,84026,402,0002,030,0002,461,696