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 07:09Chandrasekaran AkashChandrasekaran AkashScore: 64,481Success
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 07:0964,43555,287,00222,848,000993,0002,445,312
2Apr 14, 2025 07:0964,48148,654,49322,864,000994,0002,531,328
3Apr 14, 2025 07:0964,52446,434,30022,880,000994,0002,527,232