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:06KeefeKeefeScore: 111,173Success
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:06110,77067,503,35237,987,0002,998,0002,408,448
2Apr 18, 2025 19:06110,87376,709,70639,022,0002,001,0002,269,184
3Apr 18, 2025 19:06110,89267,197,29940,030,0001,000,0002,269,184
4Apr 18, 2025 19:06111,11963,866,39738,106,0003,008,0002,392,064
5Apr 18, 2025 19:06111,17366,516,54640,131,0001,003,0002,400,256
6Apr 18, 2025 19:06111,22469,500,97440,150,0001,003,0002,392,064
7Apr 18, 2025 19:06111,87068,449,37340,383,0001,009,0002,269,184
8Apr 18, 2025 19:06111,92270,180,95440,401,0001,010,0002,392,064
9Apr 18, 2025 19:06112,05766,985,02040,450,0001,011,0002,269,184