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:58Chandrasekaran AkashChandrasekaran AkashScore: 61,938Success
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:5861,91448,708,81520,916,0001,992,0002,449,408
2Apr 18, 2025 00:5861,93854,926,44920,925,0001,992,0002,445,312
3Apr 18, 2025 00:5862,10548,908,74621,980,000999,0002,531,328