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 listApr 18, 2025 19:46KeefeKeefeScore: 80,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 19:4679,80050,708,33527,490,0002,036,0002,269,184
2Apr 18, 2025 19:4679,88950,777,92328,540,0001,019,0002,404,352
3Apr 18, 2025 19:4679,89251,361,08028,541,0001,019,0002,392,064
4Apr 18, 2025 19:4679,90049,329,89228,544,0001,019,0002,400,256
5Apr 18, 2025 19:4680,01162,079,58128,584,0001,020,0002,269,184
6Apr 18, 2025 19:4680,02457,332,42027,567,0002,042,0002,269,184
7Apr 18, 2025 19:4680,15959,634,31029,659,00002,400,256
8Apr 18, 2025 19:4680,65152,743,57027,852,0001,989,0002,400,256
9Apr 18, 2025 19:4680,67662,100,79227,860,0001,990,0002,269,184