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 listOct 3, 2023 11:24apuxbtapuxbtError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2023 11:2400000Error: expected "429496447569 ", got "373661940412 "stderr
2Oct 3, 2023 11:2500000Error: expected "429496446444 ", got "412316597042 "stderr
3Oct 3, 2023 11:2580,81597,699,99529,901,41302,269,184
4Oct 3, 2023 11:2580,93789,299,64229,946,84502,273,280
5Oct 3, 2023 11:2581,69687,868,13230,227,69202,260,992