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 12, 2023 23:13Yurkov AlekseyYurkov AlekseyScore: 179,852Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2023 23:13179,711125,441,29666,493,16102,265,088
2May 12, 2023 23:13179,852123,136,41266,545,17102,269,184
3May 12, 2023 23:13180,201133,254,28966,674,27102,277,376