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:27woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 21,744,460Success
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:2721,696,2598,088,884,2468,027,615,68402,297,856
2Mar 30, 2024 09:2721,744,4608,118,993,0538,045,450,34102,293,760
3Mar 30, 2024 09:2721,904,9578,161,196,4038,104,834,03102,297,856