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:56Kenneth MaplesKenneth MaplesScore: 152,790Success
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:56152,656112,084,09956,482,85502,224,128
2Oct 11, 2022 21:56152,790154,758,13856,532,41602,211,840
3Oct 11, 2022 21:56156,552118,186,68757,924,31202,236,416