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 listDec 25, 2024 09:42Joad 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
1Dec 25, 2024 09:4200000Error: No answer to stdout. Died or killed?stderr
2Dec 25, 2024 09:4300000Error: expected "2193285442 ", got "2109213408 "stderr
3Dec 25, 2024 09:4300000Error: No answer to stdout. Died or killed?stderr
4Dec 25, 2024 10:1400000Error: expected "2152176383 ", got "2109585311 "stderr
5Dec 25, 2024 10:1500000Error: No answer to stdout. Died or killed?stderr
6Dec 25, 2024 10:2400000Error: expected "2200113683 ", got "2200097192 "stderr
7Dec 25, 2024 10:2500000Error: expected "2165444789 ", got "2165428266 "stderr