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 10:01woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 832,055Success
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 10:01668,849307,636,943247,474,19302,220,032
2Mar 30, 2024 10:01832,055369,748,977307,860,24702,215,936
3Mar 30, 2024 10:01863,815391,330,241319,611,72202,207,744