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 listMar 30, 2024 09:31woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 654,774Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2024 09:31653,310310,843,368241,724,59902,289,664
2Mar 30, 2024 09:31654,774304,653,997242,266,41802,293,760
3Mar 30, 2024 09:31657,359308,611,178243,222,96502,285,568