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:12Yurkov AlekseyYurkov AlekseyScore: 177,962Success
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:12177,899123,520,21265,822,75402,265,088
2May 12, 2023 23:12177,962124,670,13265,845,86902,256,896
3May 12, 2023 23:12180,276149,033,33166,702,24802,265,088