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 27, 2023 15:34apuxbtapuxbtScore: 1,847,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2023 15:341,629,250668,080,697602,822,62902,260,992
2Sep 27, 2023 15:341,847,154757,953,397683,447,11302,289,664
3Sep 27, 2023 15:342,133,757848,632,945789,490,06602,265,088