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 listJul 22, 2024 15:32Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2024 15:3200000Error: expected "2191474263 ", got "2147483648 "stderr
2Jul 22, 2024 15:3200000Error: expected "2249980317 ", got "2147483648 "stderr
3Jul 22, 2024 15:3300000Error: No answer to stdout. Died or killed?stderr
4Jul 22, 2024 15:344,055600,944,67533,252,66902,285,568
5Jul 22, 2024 15:344,065595,019,60833,330,99602,367,488
6Jul 22, 2024 15:344,074595,312,41933,407,63802,301,952