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 28, 2023 19:06Yurkov AlekseyYurkov AlekseyScore: 180,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2023 19:06180,548134,993,00366,802,73202,269,184
2Mar 28, 2023 19:06180,741130,696,00766,874,15602,269,184
3Mar 28, 2023 19:06180,814123,059,74466,901,00402,269,184