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 18:11Chandrasekaran AkashChandrasekaran AkashScore: 69,900Success
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 18:1169,48655,323,39224,682,0001,028,0002,449,408
2Apr 11, 2025 18:1169,90050,784,01824,869,000994,0002,445,312
3Apr 11, 2025 18:1170,11649,922,06023,948,0001,995,0002,441,216