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 listApr 18, 2025 02:04Chandrasekaran AkashChandrasekaran AkashScore: 61,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 02:0461,74351,402,06120,859,0001,986,0002,269,184
2Apr 18, 2025 02:0461,77047,366,44322,855,00002,531,328
3Apr 18, 2025 02:0461,88450,482,91121,902,000995,0002,269,184