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 listOct 19, 2025 12:50Aleksei ShahoikaAleksei ShahoikaScore: 169,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2025 12:50169,41688,175,66162,684,00002,269,184
2Oct 19, 2025 12:50169,83084,714,33260,843,0001,994,0002,285,568
3Oct 19, 2025 12:50170,10091,401,02260,939,0001,998,0002,260,992