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 00:39Chandrasekaran AkashChandrasekaran AkashScore: 65,697Success
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 00:3964,90049,306,47622,012,0002,001,0002,449,408
2Apr 18, 2025 00:3965,69746,784,29123,296,0001,012,0002,445,312
3Apr 18, 2025 00:3966,04344,756,71224,436,00002,531,328