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:29Chandrasekaran AkashChandrasekaran AkashScore: 8,361,697Success
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:298,082,5193,017,160,3332,989,533,000999,0002,441,216
2Apr 14, 2025 03:298,361,6973,121,242,9233,093,828,00002,269,184
3Apr 14, 2025 03:298,373,4863,133,838,5323,097,191,000999,0002,531,328