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 14, 2025 03:28Chandrasekaran AkashChandrasekaran AkashScore: 7,301,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2025 03:287,297,0142,729,442,8472,698,896,000999,0002,269,184
2Apr 14, 2025 03:287,301,7002,730,771,6092,699,631,0001,998,0002,433,024
3Apr 14, 2025 03:287,303,4952,729,936,8662,702,293,00002,449,408