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 listMay 29, 2024 23:04Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2024 23:0400000Error: expected "2201066904 ", got "0"stderr
2May 29, 2024 23:0400000Error: No answer to stdout. Died or killed?stderr
3May 29, 2024 23:0400000Error: expected "2180315769 ", got "2182539527"stderr
4May 29, 2024 23:0500000Error: expected "2084858076 ", got "2073472540"stderr
5May 29, 2024 23:0600000Error: No answer to stdout. Died or killed?stderr
6May 29, 2024 23:0600000Error: expected "2148671758 ", got "2149196828"stderr