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,403Success
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,26549,978,69724,999,000999,0002,273,280
2May 17, 2025 22:3270,40353,300,97724,046,0002,003,0002,273,280
3May 17, 2025 22:3270,75752,623,33125,174,0001,006,0002,273,280