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 listDec 24, 2023 03:37Kenneth MaplesKenneth MaplesScore: 78,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 03:3777,32466,217,01227,589,0001,021,0002,285,568
2Dec 24, 2023 03:3777,59254,263,43727,684,0001,025,0002,285,568
3Dec 24, 2023 03:3777,91158,709,47627,833,000994,0002,338,816
4Dec 24, 2023 03:3777,93055,674,92826,846,0001,988,0002,285,568
5Dec 24, 2023 03:3777,95957,788,62028,845,00002,498,560
6Dec 24, 2023 03:3777,97656,031,73428,851,00002,285,568
7Dec 24, 2023 03:3778,01154,968,24326,874,0001,990,0002,502,656
8Dec 24, 2023 03:3778,04356,270,52326,885,0001,991,0002,498,560
9Dec 24, 2023 03:3778,05151,705,01026,888,0001,991,0002,502,656
10Dec 24, 2023 03:3782,06887,571,38330,365,21002,207,744
11Dec 24, 2023 03:3782,30295,037,52930,451,70802,215,936
12Dec 24, 2023 03:3782,458102,309,00830,509,58902,211,840