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 17:04apuxbtapuxbtScore: 79,717Success
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 17:0478,97084,699,29629,218,91302,273,280
2Sep 28, 2023 17:0479,71798,279,64529,495,11002,277,376
3Sep 28, 2023 17:0479,96889,889,63129,588,19102,265,088