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 listJul 8, 2021 22:20Yuriy LyfenkoYuriy LyfenkoScore: 68,069Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 22:2067,576607,889,89525,003,09802,252,800
2Jul 8, 2021 22:2068,069588,355,40725,185,42702,248,704
3Jul 8, 2021 22:2069,599575,480,67825,751,48802,252,800