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 listNov 21, 2023 12:22AdrKAdrKScore: 1,774,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2023 12:22772,668349,338,892285,887,06302,289,664
2Nov 21, 2023 12:221,774,766709,966,848656,663,56102,297,856
3Nov 21, 2023 12:221,791,061735,200,115662,692,45002,297,856