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 03:15Joad 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 03:1500000Error: expected "2221929284 ", got "2222783532 "stderr
2Dec 25, 2024 03:1500000Error: No answer to stdout. Died or killed?stderr
3Dec 25, 2024 03:1600000Error: expected "2125182308 ", got "2125250083 "stderr
4Dec 25, 2024 03:1700000Error: expected "2185537451 ", got "2184259723 "stderr
5Dec 25, 2024 03:1700000Error: expected "2159081877 ", got "2159592881 "stderr
6Dec 25, 2024 03:1700000Error: No answer to stdout. Died or killed?stderr
7Dec 25, 2024 03:1700000Error: No answer to stdout. Died or killed?stderr
8Dec 25, 2024 03:1800000Error: expected "2069319684 ", got "2069799059 "stderr
9Dec 25, 2024 03:1800000Error: No answer to stdout. Died or killed?stderr
10Dec 25, 2024 03:1800000Error: expected "2179953254 ", got "2179579749 "stderr