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:16Kenneth MaplesKenneth MaplesScore: 75,265Success
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:1674,46251,246,42226,531,0001,020,0002,285,568
2Dec 24, 2023 03:1674,66555,128,63426,603,0001,023,0002,285,568
3Dec 24, 2023 03:1674,67053,515,17726,605,0001,023,0002,502,656
4Dec 24, 2023 03:1674,70852,782,83626,619,0001,023,0002,285,568
5Dec 24, 2023 03:1674,88454,505,05527,707,00002,285,568
6Dec 24, 2023 03:1674,89555,532,13626,685,0001,026,0002,490,368
7Dec 24, 2023 03:1675,26555,970,41325,859,0001,989,0002,285,568
8Dec 24, 2023 03:1675,27657,555,97326,858,000994,0002,285,568
9Dec 24, 2023 03:1675,32755,058,28326,876,000995,0002,502,656
10Dec 24, 2023 03:1679,44994,523,34829,395,98602,232,320
11Dec 24, 2023 03:1679,65396,246,22929,471,59602,228,224
12Dec 24, 2023 03:1679,71097,577,00129,492,75702,224,128