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 listMar 25, 2023 18:11Yurkov AlekseyYurkov AlekseyScore: 145,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2023 18:11145,779119,124,22353,938,41102,265,088
2Mar 25, 2023 18:11145,895110,835,80053,981,29302,265,088
3Mar 25, 2023 18:11146,109121,827,37954,060,40302,265,088