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 listFeb 21, 2024 09:53Huy Duc LeHuy Duc LeError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2024 09:5300000Error: No answer to stdout. Died or killed?stderr
2Feb 21, 2024 09:5300000Error: No answer to stdout. Died or killed?stderr
3Feb 21, 2024 09:5400000Error: No answer to stdout. Died or killed?stderr
4Feb 21, 2024 09:5400000Error: No answer to stdout. Died or killed?stderr
5Feb 21, 2024 09:5500000Error: No answer to stdout. Died or killed?stderr
6Feb 21, 2024 09:5500000Error: No answer to stdout. Died or killed?stderr
7Feb 21, 2024 09:5600000Error: No answer to stdout. Died or killed?stderr
8Feb 21, 2024 09:5700000Error: No answer to stdout. Died or killed?stderr
9Feb 21, 2024 09:5800000Error: No answer to stdout. Died or killed?stderr
10Feb 21, 2024 09:5900000Error: No answer to stdout. Died or killed?stderr
11Feb 21, 2024 09:5900000Error: No answer to stdout. Died or killed?stderr
12Feb 21, 2024 10:0000000Error: No answer to stdout. Died or killed?stderr