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:37Yurkov AlekseyYurkov AlekseyScore: 102,169Success
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:37101,93497,097,65237,715,67102,260,992
2Sep 1, 2022 00:37102,16992,149,61737,802,59602,269,184
3Sep 1, 2022 00:37103,110107,799,95738,150,64102,269,184