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 01:11Chandrasekaran AkashChandrasekaran AkashScore: 62,351Success
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 01:1162,21444,239,40121,018,0002,001,0002,441,216
2Apr 18, 2025 01:1162,35145,897,02122,067,0001,003,0002,449,408
3Apr 18, 2025 01:1162,43550,845,44621,093,0002,008,0002,269,184