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 06:41Chandrasekaran AkashChandrasekaran AkashScore: 65,997Success
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 06:4165,76845,631,48223,321,0001,013,0002,449,408
2Apr 14, 2025 06:4165,99742,936,40724,419,00002,445,312
3Apr 14, 2025 06:4166,20844,502,22023,477,0001,020,0002,441,216