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 listMay 17, 2025 22:32KeefeKeefeScore: 70,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2025 22:3270,13853,801,39723,955,0001,996,0002,404,352
2May 17, 2025 22:3270,15150,427,02324,958,000998,0002,273,280
3May 17, 2025 22:3270,22250,421,24123,984,0001,998,0002,400,256
4May 17, 2025 22:3270,23850,794,77225,988,00002,273,280
5May 17, 2025 22:3270,40548,740,16525,049,0001,001,0002,273,280
6May 17, 2025 22:3270,45147,368,07525,065,0001,002,0002,273,280
7May 17, 2025 22:3270,47051,789,54024,069,0002,005,0002,273,280
8May 17, 2025 22:3270,49760,219,90324,078,0002,006,0002,273,280
9May 17, 2025 22:3270,63253,718,84624,124,0002,010,0002,273,280