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 22, 2022 16:02Bernard 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 22, 2022 16:0200000Error: expected "2162394997 ", got "2"
2Nov 22, 2022 16:0300000Error: expected "2116562928 ", got "2"
3Nov 22, 2022 16:035,929126,508,52048,620,07002,195,456
4Nov 22, 2022 16:036,031113,626,49749,450,49902,195,456
5Nov 22, 2022 16:036,055130,774,42849,647,25202,265,088
6Nov 22, 2022 16:036,080123,134,05649,855,51902,297,856
7Nov 22, 2022 16:036,082103,673,64249,868,85102,203,648
8Nov 22, 2022 16:036,096115,018,19749,990,02602,244,608
9Nov 22, 2022 16:036,118111,068,16250,164,99502,179,072
10Nov 22, 2022 16:036,166120,490,54650,560,52002,199,552
11Nov 22, 2022 16:036,266115,744,03551,385,15602,183,168