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 26, 2025 06:35E SequeiraE SequeiraScore: 247,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2025 06:35241,327117,027,81487,285,0002,006,0002,285,568
2May 26, 2025 06:35247,516118,189,45190,575,0001,006,0002,375,680
3May 26, 2025 06:35249,046113,653,82290,144,0002,003,0002,273,280