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 05:43Chandrasekaran AkashChandrasekaran AkashScore: 67,578Success
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 03:1967,15151,679,37824,846,00002,449,408
2Apr 12, 2025 05:4367,19756,500,38024,863,00002,269,184
3Apr 14, 2025 03:1967,23046,557,17623,880,000995,0002,531,328
4Apr 14, 2025 03:1967,23548,488,30323,882,000995,0002,453,504
5Apr 14, 2025 03:1967,25749,522,36323,890,000995,0002,531,328
6Apr 14, 2025 03:1967,57648,175,04624,003,0001,000,0002,445,312
7Apr 14, 2025 03:1967,57846,963,35024,004,0001,000,0002,449,408
8Apr 12, 2025 05:4367,58648,749,93524,007,0001,000,0002,269,184
9Apr 12, 2025 05:4367,74150,618,92824,062,0001,002,0002,531,328
10Apr 14, 2025 03:1967,74352,207,24023,060,0002,005,0002,531,328
11Apr 14, 2025 03:1967,78649,528,45925,081,00002,269,184
12Apr 14, 2025 03:1967,78945,049,52624,079,0001,003,0002,445,312