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 18:45Yurkov AlekseyYurkov AlekseyError
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 18:4500000Error: expected "429496511488 ", got "429496492392 "
2Mar 28, 2023 18:4598,821115,780,30736,563,86702,269,184
3Mar 28, 2023 18:4599,076110,247,86036,658,09002,265,088
4Mar 28, 2023 18:45100,303104,966,88537,112,20502,269,184