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 listSep 28, 2023 15:51apuxbtapuxbtError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 15:5100000Error: expected "429496457440 ", got "214748192633 "stderr
2Sep 28, 2023 15:5300000Error: expected "429496468009 ", got "214748163602 "stderr
3Sep 28, 2023 15:5400000Error: expected "429496480574 ", got "214748195251 "stderr
4Sep 28, 2023 15:5400000Error: expected "429496544119 ", got "214748158507 "stderr