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 listSep 18, 2021 22:22Ilya AniskovetsIlya AniskovetsScore: 4,186,779Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 18, 2021 22:224,172,1181,621,962,6741,543,683,71702,187,264
2Sep 18, 2021 22:224,186,7791,638,350,3661,549,108,12702,232,320
3Sep 18, 2021 22:224,217,4701,696,549,0961,560,463,98502,236,416