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 19:38Yuriy LyfenkoYuriy LyfenkoScore: 143,089Success
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 19:38142,971118,268,30152,899,26302,187,264
2Jul 8, 2021 19:38143,089117,733,81952,943,00902,195,456
3Jul 8, 2021 19:38143,260108,930,93853,006,23802,199,552