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 03:23Chandrasekaran AkashChandrasekaran AkashScore: 60,689Success
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 03:2360,62754,210,59721,413,0001,019,0002,449,408
2Apr 18, 2025 03:2360,68944,131,62321,435,0001,020,0002,445,312
3Apr 18, 2025 03:2360,84647,235,27021,490,0001,023,0002,531,328