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 12:17Yuriy LyfenkoYuriy LyfenkoScore: 89,288Success
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 12:1789,01587,536,33032,935,38902,248,704
2Jul 8, 2021 12:1789,28895,278,22533,036,57102,260,992
3Jul 8, 2021 12:1790,300105,713,34533,410,90502,248,704