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 14, 2025 05:49Chandrasekaran AkashChandrasekaran AkashScore: 66,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2025 05:4864,01945,389,77823,687,00002,449,408
2Apr 14, 2025 05:4864,44348,884,67922,851,000993,0002,449,408
3Apr 14, 2025 05:4864,48952,010,56121,873,0001,988,0002,441,216
4Apr 14, 2025 05:4966,63247,747,68224,654,00002,445,312
5Apr 14, 2025 05:4967,17655,110,79522,867,0001,988,0002,445,312
6Apr 14, 2025 05:4967,19754,829,01623,869,000994,0002,449,408