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 11, 2025 02:27Chandrasekaran AkashChandrasekaran AkashScore: 75,973Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2025 02:2672,61453,834,29026,867,00002,449,408
2Apr 11, 2025 02:2673,10351,992,54926,047,0001,001,0002,531,328
3Apr 11, 2025 02:2674,11452,394,81827,422,00002,531,328
4Apr 11, 2025 02:2775,97349,181,41527,107,0001,003,0002,527,232
5Apr 11, 2025 02:2776,34357,325,74226,230,0002,017,0002,441,216
6Apr 11, 2025 02:2777,99753,887,04927,864,000995,0002,437,120