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 23:27zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:47Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:47010,027,6602,311,000020,480No answer to stdout. Died or killed?
2Oct 16, 2024 23:273,42954,592,74027,110,0001,004,0002,310,144
3Oct 16, 2024 23:273,44249,339,68226,207,0002,015,0002,289,664
4Oct 16, 2024 23:273,46852,118,18826,408,0002,031,0002,506,752