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 19, 2021 13:36Yuriy LyfenkoYuriy LyfenkoScore: 192,407Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2021 13:36191,997637,359,88171,038,72902,301,952
2Jul 19, 2021 13:36192,407640,869,34171,190,54902,252,800
3Jul 19, 2021 13:36197,278638,153,58072,992,69902,248,704