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 listNov 20, 2022 07:22Bernard TeoBernard TeoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2022 07:2200000Error: expected "2062725178 ", got "1"
2Nov 20, 2022 07:2200000Error: expected "2253521814 ", got "1"
3Nov 20, 2022 07:2200000Error: expected "2270883760 ", got "1"
4Nov 20, 2022 07:2200000Error: expected "2023850182 ", got "1"
5Nov 20, 2022 07:2200000Error: expected "2017610834 ", got "1"
6Nov 20, 2022 07:2200000Error: expected "2297336466 ", got "1"
7Nov 20, 2022 07:2200000Error: expected "2242036823 ", got "1"
8Nov 20, 2022 07:2300000Error: expected "2308771548 ", got "1"
9Nov 20, 2022 07:2300000Error: expected "2273887093 ", got "1"
10Nov 20, 2022 07:2400000Error: expected "2069366968 ", got "1"
11Nov 20, 2022 07:227,199122,818,02659,028,50502,289,664
12Nov 20, 2022 07:227,238117,270,47259,349,21602,240,512
13Nov 20, 2022 07:227,263148,537,39159,560,45002,179,072