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 14, 2025 06:18Chandrasekaran AkashChandrasekaran AkashScore: 62,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2025 06:1861,92445,771,15420,920,0001,992,0002,531,328
2Apr 14, 2025 06:1862,03049,863,67820,956,0001,995,0002,269,184
3Apr 14, 2025 06:1862,12744,710,85120,989,0001,998,0002,269,184