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 05:53Chandrasekaran AkashChandrasekaran AkashScore: 67,576Success
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 05:5367,19756,242,03822,874,0001,989,0002,269,184
2Apr 14, 2025 05:5367,57645,432,66624,003,0001,000,0002,531,328
3Apr 14, 2025 05:5368,16247,714,92824,212,0001,008,0002,531,328