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:33Joad 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:3300000Error: expected "2188178106 ", got "0"stderr
2May 29, 2024 23:3300000Error: expected "2239291635 ", got "3602525075"stderr
3May 29, 2024 23:3300000Error: No answer to stdout. Died or killed?stderr
4May 29, 2024 23:3300000Error: No answer to stdout. Died or killed?stderr
5May 29, 2024 23:3400000Error: No answer to stdout. Died or killed?stderr
6May 29, 2024 23:3400000Error: No answer to stdout. Died or killed?stderr
7May 29, 2024 23:3400000Error: expected "2193770016 ", got "0"stderr
8May 29, 2024 23:3400000Error: expected "2183348131 ", got "0"stderr
9May 29, 2024 23:3400000Error: No answer to stdout. Died or killed?stderr
10May 29, 2024 23:3400000Error: expected "2227311951 ", got "2790783057"stderr
11May 29, 2024 23:3400000Error: No answer to stdout. Died or killed?stderr