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 30, 2022 20:36PhibPhibScore: 1,907,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2022 20:361,436,652586,505,545531,561,22602,301,952
2Sep 30, 2022 20:361,907,464775,811,062705,761,67502,306,048
3Sep 30, 2022 20:362,151,281862,635,679795,973,90702,301,952