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:31Kenneth MaplesKenneth MaplesScore: 78,954Success
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:3178,49257,032,16428,041,0001,001,0002,502,656
2Dec 24, 2023 03:3178,63053,001,16028,090,0001,003,0002,502,656
3Dec 24, 2023 03:3178,75757,703,91827,131,0002,009,0002,285,568
4Dec 24, 2023 03:3178,78152,197,46927,139,0002,010,0002,506,752
5Dec 24, 2023 03:3178,84152,370,30127,160,0002,011,0002,285,568
6Dec 24, 2023 03:3178,86251,994,66127,167,0002,012,0002,502,656
7Dec 24, 2023 03:3178,95456,555,67527,199,0002,014,0002,506,752
8Dec 24, 2023 03:3179,25151,725,23327,301,0002,022,0002,330,624
9Dec 24, 2023 03:3179,30551,374,23627,320,0002,023,0002,498,560
10Dec 24, 2023 03:3183,251104,209,60730,802,83002,215,936
11Dec 24, 2023 03:3183,28197,920,60830,813,82502,211,840
12Dec 24, 2023 03:3183,74992,690,74130,987,26802,220,032