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 10, 2021 13:51Andrey TsvetkovAndrey TsvetkovScore: 89,002Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2021 13:5188,700100,941,66832,818,89402,228,224
2Sep 10, 2021 13:5189,002106,264,98232,930,72602,215,936
3Sep 10, 2021 13:5189,580102,681,74933,144,71802,224,128