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 12, 2025 04:37Chandrasekaran AkashChandrasekaran AkashScore: 67,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2025 04:3767,20555,549,84223,872,000994,0002,449,408
2Apr 12, 2025 04:3767,22248,208,62823,878,000994,0002,531,328
3Apr 12, 2025 04:3767,34148,027,91923,920,000996,0002,531,328
4Apr 12, 2025 04:3767,45445,195,84822,962,0001,996,0002,269,184
5Apr 12, 2025 04:3767,60845,450,06024,015,0001,000,0002,531,328
6Apr 12, 2025 04:3767,75147,566,04523,063,0002,005,0002,527,232
7Apr 12, 2025 04:3767,79744,649,21524,082,0001,003,0002,449,408
8Apr 12, 2025 04:3767,80547,930,25923,081,0002,007,0002,531,328
9Apr 12, 2025 04:3768,10357,392,78724,191,0001,007,0002,531,328