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 04:11Chandrasekaran AkashChandrasekaran AkashScore: 67,486Success
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 04:1167,21646,974,62122,881,0001,989,0002,453,504
2Apr 14, 2025 04:1167,48649,345,64323,972,000998,0002,449,408
3Apr 14, 2025 04:1167,61946,770,55624,019,0001,000,0002,531,328