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 14, 2021 12:40Mikhail ShirokovMikhail ShirokovScore: 21,548,781Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2021 12:4021,478,7428,004,502,6807,947,134,58702,248,704
2Sep 14, 2021 12:4021,548,7818,033,396,0247,973,048,99802,281,472
3Sep 14, 2021 12:4021,568,6908,046,108,3707,980,415,19002,273,280