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:26Chandrasekaran AkashChandrasekaran AkashScore: 60,657Success
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:2660,51942,599,17822,392,00002,269,184
2Apr 18, 2025 03:2660,52244,981,66722,393,00002,445,312
3Apr 18, 2025 03:2660,52745,162,10922,395,00002,441,216
4Apr 18, 2025 03:2660,63048,624,46021,414,0001,019,0002,531,328
5Apr 18, 2025 03:2660,65743,271,27722,443,00002,527,232
6Apr 18, 2025 03:2660,71944,017,48222,466,00002,445,312
7Apr 18, 2025 03:2660,73546,796,72521,451,0001,021,0002,445,312
8Apr 18, 2025 03:2660,78141,985,52121,467,0001,022,0002,449,408
9Apr 18, 2025 03:2661,04947,839,45222,588,00002,531,328