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 05:30Chandrasekaran AkashChandrasekaran AkashScore: 68,222Success
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 05:3164,62250,975,61722,914,000996,0002,531,328
2Apr 14, 2025 05:3164,63544,764,51122,919,000996,0002,269,184
3Apr 14, 2025 05:3165,18948,177,86823,115,0001,005,0002,441,216
4Apr 14, 2025 05:3068,22251,598,38823,223,0002,019,0002,449,408
5Apr 14, 2025 05:3068,39248,290,26525,305,00002,441,216
6Apr 14, 2025 05:3068,49747,580,79524,331,0001,013,0002,441,216