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 11, 2025 20:42Yuriy LyfenkoYuriy LyfenkoScore: 59,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2025 20:4259,459544,574,55320,000,0002,000,0002,527,232
2Apr 11, 2025 20:4259,470545,178,27520,004,0002,000,0002,265,088
3Apr 11, 2025 20:4259,492543,323,98720,011,0002,001,0002,531,328