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:47Kenneth MaplesKenneth MaplesScore: 183,132Success
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:47183,001132,891,91267,710,50202,228,224
2Oct 11, 2022 21:47183,132137,782,53067,758,74902,224,128
3Oct 11, 2022 21:47183,238128,045,88567,797,94502,220,032