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 00:35Chandrasekaran AkashChandrasekaran AkashScore: 71,727Success
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 00:3571,42251,588,31525,410,0001,016,0002,531,328
2Apr 11, 2025 00:3571,43253,522,48726,430,00002,445,312
3Apr 11, 2025 00:3571,52248,591,61026,463,00002,531,328
4Apr 11, 2025 00:3571,67648,325,39225,500,0001,020,0002,445,312
5Apr 11, 2025 00:3571,72750,013,79326,539,00002,453,504
6Apr 11, 2025 00:3571,75454,096,15925,528,0001,021,0002,445,312
7Apr 11, 2025 00:3571,80354,647,75526,567,00002,449,408
8Apr 11, 2025 00:3571,81654,510,91725,588,000984,0002,531,328
9Apr 11, 2025 00:3573,41150,810,74926,156,0001,006,0002,527,232