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 13:29Yuriy LyfenkoYuriy LyfenkoScore: 68,743Success
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 13:2968,617585,490,16225,388,26202,244,608
2Jul 8, 2021 13:2968,743581,063,58125,434,85902,240,512
3Jul 8, 2021 13:2968,851593,690,43625,474,98902,244,608