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 18, 2025 03:23Chandrasekaran AkashChandrasekaran AkashScore: 60,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 03:2360,68443,465,96422,453,00002,531,328
2Apr 18, 2025 03:2360,83843,481,34422,510,00002,445,312
3Apr 18, 2025 03:2360,97351,436,19722,560,00002,441,216