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:12Kenneth MaplesKenneth MaplesScore: 74,830Success
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:1274,55153,080,14026,563,0001,021,0002,285,568
2Dec 24, 2023 03:1274,55154,299,63526,563,0001,021,0002,285,568
3Dec 24, 2023 03:1274,57051,111,74026,570,0001,021,0002,285,568
4Dec 24, 2023 03:1274,61154,877,94226,584,0001,022,0002,285,568
5Dec 24, 2023 03:1274,72761,327,23326,625,0001,024,0002,494,464
6Dec 24, 2023 03:1274,73561,446,67626,628,0001,024,0002,506,752
7Dec 24, 2023 03:1274,83052,701,08927,687,00002,285,568
8Dec 24, 2023 03:1275,25455,119,42625,856,0001,988,0002,355,200
9Dec 24, 2023 03:1275,40359,772,02525,907,0001,992,0002,351,104
10Dec 24, 2023 03:1277,03783,983,88528,503,59902,207,744
11Dec 24, 2023 03:1277,196102,390,58928,562,41302,228,224
12Dec 24, 2023 03:1277,38276,161,73828,631,17002,224,128