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 19, 2024 16:44Joad 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 19, 2024 16:4200000Error: No answer to stdout. Died or killed?stderr
2May 19, 2024 16:4300000Error: No answer to stdout. Died or killed?
3May 19, 2024 16:4500000Error: No answer to stdout. Died or killed?stderr
4May 19, 2024 16:4500000Error: expected "2294321859 ", got "0"stderr
5May 19, 2024 16:4500000Error: expected "2316819140 ", got "0"stderr
6May 19, 2024 16:4500000Error: No answer to stdout. Died or killed?stderr
7May 20, 2024 12:5100000Error: expected "2228054182 ", got "0"stderr
8May 19, 2024 16:459,650140,700,55179,127,33602,248,704
9May 19, 2024 16:4510,035157,138,81782,289,18502,260,992
10May 19, 2024 16:4510,915145,155,70289,505,47002,224,128
11May 19, 2024 16:4412,263160,914,007100,558,03602,244,608
12May 19, 2024 16:4412,266165,700,610100,580,27202,195,456
13May 19, 2024 16:4412,621166,471,250103,495,56602,342,912