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 03:16Chandrasekaran AkashChandrasekaran AkashScore: 8,118,224Success
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 03:168,074,2923,008,970,4122,986,489,000999,0002,449,408
2Apr 11, 2025 03:168,118,2243,027,161,2943,002,744,000999,0002,453,504
3Apr 11, 2025 03:168,137,5323,034,142,4773,009,888,000999,0002,269,184