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 7, 2021 23:56Yuriy LyfenkoYuriy LyfenkoScore: 148,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2021 23:56148,4301,078,599,28354,919,061063,344,640
2Jul 7, 2021 23:56148,9591,032,083,71055,114,830061,239,296
3Jul 7, 2021 23:56150,9881,086,012,93855,865,524061,378,560