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 18, 2025 00:52Chandrasekaran AkashChandrasekaran AkashScore: 65,203Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 00:5264,97051,555,14423,038,0001,001,0002,449,408
2Apr 18, 2025 00:5164,97644,254,89223,040,0001,001,0002,531,328
3Apr 18, 2025 00:5165,01649,338,72123,054,0001,002,0002,445,312
4Apr 18, 2025 00:5265,20350,392,73222,115,0002,010,0002,441,216
5Apr 18, 2025 00:5265,33048,179,14723,165,0001,007,0002,531,328
6Apr 18, 2025 00:5165,54643,366,94222,231,0002,021,0002,445,312