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 11, 2022 21:45Kenneth MaplesKenneth MaplesScore: 183,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2022 21:45183,331136,512,61567,832,34802,224,128
2Oct 11, 2022 21:45183,614130,508,35167,937,00902,220,032
3Oct 11, 2022 21:45184,029131,322,41668,090,73002,228,224