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 01:38Chandrasekaran AkashChandrasekaran AkashScore: 72,476Success
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:1071,60050,825,31625,474,0001,018,0002,527,232
2Apr 11, 2025 02:1071,90850,994,06126,606,00002,453,504
3Apr 11, 2025 01:3871,96859,741,92726,628,00002,531,328
4Apr 11, 2025 02:1072,47651,533,81224,830,0001,986,0002,449,408
5Apr 11, 2025 01:3873,22251,951,85025,086,0002,006,0002,445,312
6Apr 11, 2025 01:3873,24949,140,92726,099,0001,003,0002,449,408