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 listSep 8, 2025 21:23Aleksei ShahoikaAleksei ShahoikaScore: 283,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2025 21:23282,854130,853,448103,650,0001,006,0002,265,088
2Sep 8, 2025 21:23282,862142,032,156103,653,0001,006,0002,519,040
3Sep 8, 2025 21:23282,878131,771,868103,659,0001,006,0002,269,184
4Sep 8, 2025 21:23282,935134,746,553102,692,0001,994,0002,285,568
5Sep 8, 2025 21:23283,011134,170,116102,720,0001,994,0002,285,568
6Sep 8, 2025 21:23283,170135,733,514102,778,0001,995,0002,285,568
7Sep 8, 2025 21:23283,189129,379,259102,785,0001,995,0002,285,568
8Sep 8, 2025 21:23283,262131,685,836102,811,0001,996,0002,285,568
9Sep 8, 2025 21:23283,314132,179,935102,830,0001,996,0002,510,848