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:34KeefeKeefeScore: 70,538Success
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:3470,24651,932,32523,992,0001,999,0002,408,448
2May 17, 2025 22:3470,53848,696,10125,096,0001,003,0002,273,280
3May 17, 2025 22:3470,61650,526,13424,119,0002,009,0002,408,448