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 02:57Chandrasekaran AkashChandrasekaran AkashScore: 60,711Success
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 02:5760,60043,420,63022,422,00002,445,312
2Apr 18, 2025 02:5760,71150,261,64222,463,00002,269,184
3Apr 18, 2025 02:5760,87840,992,29121,502,0001,023,0002,269,184