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 06:09Chandrasekaran AkashChandrasekaran AkashScore: 67,630Success
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 06:0864,45959,429,06922,857,000993,0002,531,328
2Apr 14, 2025 06:0864,66246,428,02822,929,000996,0002,531,328
3Apr 14, 2025 06:0865,18150,088,33922,108,0002,009,0002,449,408
4Apr 14, 2025 06:0967,47653,942,28823,968,000998,0002,531,328
5Apr 14, 2025 06:0967,63046,229,46123,022,0002,001,0002,531,328
6Apr 14, 2025 06:0967,67346,828,38123,036,0002,003,0002,449,408
7Apr 14, 2025 06:0967,72747,775,38324,057,0001,002,0002,531,328
8Apr 14, 2025 06:0967,76249,135,47224,070,0001,002,0002,531,328
9Apr 14, 2025 06:0968,08947,717,65323,178,0002,015,0002,449,408