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 06:20Chandrasekaran AkashChandrasekaran AkashScore: 71,073Success
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 06:2070,45149,395,20324,062,0002,005,0002,445,312
2Apr 11, 2025 06:2071,07347,824,17326,297,00002,531,328
3Apr 11, 2025 06:2071,59750,265,96325,473,0001,018,0002,449,408