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:28woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 655,267Success
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:28655,184309,310,143242,418,16702,297,856
2Mar 30, 2024 09:28655,267309,899,572242,448,87002,289,664
3Mar 30, 2024 09:28656,500300,927,640242,905,13702,293,760