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 1, 2022 00:29Yurkov AlekseyYurkov AlekseyScore: 135,491Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2022 00:29135,299111,532,03650,060,56602,269,184
2Sep 1, 2022 00:29135,491119,668,75850,131,81402,269,184
3Sep 1, 2022 00:29135,743107,488,64150,224,89002,273,280