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 20:28Yuriy 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 20:2800000Error: expected "2253720691 ", got "2147483648 "stderr
2Jul 16, 2023 20:2900000Error: No answer to stdout. Died or killed?stderr
3Jul 16, 2023 20:3000000Error: No answer to stdout. Died or killed?stderr
4Jul 16, 2023 20:3000000Error: No answer to stdout. Died or killed?stderr
5Jul 16, 2023 20:2912,074161,645,18799,003,51602,211,840
6Jul 16, 2023 20:2912,160181,889,71199,711,74902,240,512
7Jul 16, 2023 20:2912,579165,081,656103,149,60402,203,648