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 16, 2023 23:17Yuriy 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 16, 2023 23:1800000Error: expected "2173856225 ", got "2147483648 "stderr
2Jul 16, 2023 23:1800000Error: No answer to stdout. Died or killed?stderr
3Jul 16, 2023 23:2100000Error: expected "2276026203 ", got "2147483648 "stderr
4Jul 16, 2023 23:2200000Error: expected "2157417223 ", got "2147483648 "stderr
5Jul 16, 2023 23:2200000Error: No answer to stdout. Died or killed?stderr
6Jul 16, 2023 23:2200000Error: No answer to stdout. Died or killed?stderr
7Jul 16, 2023 23:2200000Error: expected "2206277886 ", got "2147483648 "stderr
8Jul 16, 2023 23:174,169591,669,22034,189,61502,211,840
9Jul 16, 2023 23:174,190595,532,18834,358,98102,277,376
10Jul 16, 2023 23:174,197603,514,50534,418,94002,265,088