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 listMay 23, 2024 17:53CemaCemaScore: 389,288Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2024 17:53352,278196,648,033130,342,85602,269,184
2May 23, 2024 17:53389,288207,065,667144,036,67402,269,184
3May 23, 2024 17:53392,234210,954,161145,126,66002,265,088