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 10, 2021 13:56Andrey TsvetkovAndrey TsvetkovScore: 89,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2021 13:5688,954114,272,62432,913,02202,220,032
2Sep 10, 2021 13:5689,10192,934,68132,967,55302,224,128
3Sep 10, 2021 13:5689,60393,755,86733,153,22102,228,224