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 18:10apuxbtapuxbtScore: 77,105Success
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 18:1076,914102,554,27228,458,25402,269,184
2Sep 28, 2023 18:1077,10592,709,26328,528,82302,265,088
3Sep 28, 2023 18:1077,531107,260,92928,686,56002,265,088