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:07apuxbtapuxbtError
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:0800000Error: expected "429496514294 ", got "0 "stderr
2Sep 28, 2023 15:07179,924129,752,31866,571,94902,183,168
3Sep 28, 2023 15:07180,475134,179,11066,775,91602,183,168
4Sep 28, 2023 15:07181,557132,012,98167,176,03202,281,472