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 03:21Chandrasekaran AkashChandrasekaran AkashScore: 61,146Success
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 03:2160,92747,984,16321,519,0001,024,0002,531,328
2Apr 18, 2025 03:2161,14650,774,88621,596,0001,028,0002,269,184
3Apr 18, 2025 03:2161,27648,183,35622,672,00002,457,600