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 01:24Chandrasekaran AkashChandrasekaran AkashScore: 61,827Success
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 01:2461,72246,904,78021,845,000992,0002,531,328
2Apr 18, 2025 01:2461,75447,364,55121,856,000993,0002,531,328
3Apr 18, 2025 01:2461,77846,486,19920,871,0001,987,0002,449,408
4Apr 18, 2025 01:2461,80550,492,15221,874,000994,0002,449,408
5Apr 18, 2025 01:2461,82752,771,20120,887,0001,989,0002,453,504
6Apr 18, 2025 01:2461,88948,133,92320,908,0001,991,0002,269,184
7Apr 18, 2025 01:2461,92744,232,35820,921,0001,992,0002,453,504
8Apr 18, 2025 01:2461,94943,253,81621,925,000996,0002,445,312
9Apr 18, 2025 01:2462,02245,348,10921,951,000997,0002,531,328