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 listSep 21, 2023 18:20mmalczakmmalczakScore: 199,989Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2023 18:20199,654134,468,89673,871,94302,277,376
2Sep 21, 2023 18:20199,989133,301,75773,995,91002,269,184
3Sep 21, 2023 18:20200,177140,671,39774,065,66602,265,088