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 listAug 4, 2023 16:57gchebanovgchebanovScore: 79,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2023 16:5778,31796,247,80128,977,40702,256,896
2Aug 4, 2023 16:5779,28196,313,30629,333,85302,248,704
3Aug 4, 2023 16:5779,539100,318,65629,429,41702,265,088