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 11, 2025 01:42Chandrasekaran AkashChandrasekaran AkashScore: 71,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2025 01:4271,54147,972,55126,470,00002,531,328
2Apr 11, 2025 01:4271,64347,050,34225,489,0001,019,0002,531,328
3Apr 11, 2025 01:4273,03045,572,60226,021,0001,000,0002,445,312