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 listAug 24, 2026 01:20Andrew EpsteinAndrew EpsteinScore: 69,021Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 01:2068,65935,197,74224,338,0001,066,0002,113,536
2Aug 24, 2026 01:2068,82435,259,55024,310,0001,155,0002,113,536
3Aug 24, 2026 01:2068,92135,350,93324,334,0001,167,0002,113,536
4Aug 24, 2026 01:2069,00235,407,98124,378,0001,153,0002,113,536
5Aug 24, 2026 01:2069,02135,329,99124,384,0001,154,0002,113,536
6Aug 24, 2026 01:2069,13535,360,53324,461,0001,119,0002,113,536
7Aug 24, 2026 01:2069,24335,401,70524,459,0001,161,0002,113,536
8Aug 24, 2026 01:2069,27235,469,11824,469,0001,162,0002,113,536
9Aug 24, 2026 01:2069,58935,592,36624,575,0001,173,0002,113,536