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:51woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 2,304,512Success
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:512,189,026883,866,228809,939,44802,281,472
2Mar 30, 2024 09:512,304,512916,202,168852,669,36802,281,472
3Mar 30, 2024 09:512,314,047912,929,541856,197,36002,289,664