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 27, 2023 21:38Yurkov AlekseyYurkov AlekseyScore: 165,687Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2023 21:38165,053133,725,40061,069,69002,265,088
2Mar 27, 2023 21:38165,687126,997,64761,304,02802,273,280
3Mar 27, 2023 21:38165,875124,499,66861,373,72202,252,800