TopK Sergey Svistunov

Find the sum of the 100 largest values in 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 uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listNov 22, 2023 12:10AdrKAdrKScore: 1,691,243Success
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, 2023 12:101,184,244502,047,229438,170,21102,289,664
2Nov 22, 2023 12:101,224,714507,224,791453,144,02802,297,856
3Nov 22, 2023 12:091,236,522516,423,635457,513,17002,289,664
4Nov 22, 2023 12:101,265,321536,328,044468,168,65402,285,568
5Nov 22, 2023 12:111,344,589549,818,863497,497,76002,174,976
6Nov 22, 2023 12:091,528,803625,730,797565,657,09002,293,760
7Nov 22, 2023 12:101,691,243701,720,348625,759,98602,289,664
8Nov 22, 2023 12:111,717,946700,839,467635,640,17602,301,952
9Nov 22, 2023 12:111,796,301739,384,451664,631,44702,293,760
10Nov 22, 2023 12:091,804,162739,109,266667,540,08602,297,856
11Nov 22, 2023 12:102,028,077819,908,780750,388,65502,297,856
12Nov 22, 2023 12:102,081,263838,233,664770,067,17502,301,952