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 28, 2026 08:14TudyMTudyMScore: 107,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 08:14107,05459,582,27639,610,00002,379,776
2Apr 28, 2026 08:14107,50257,036,28236,793,0002,983,0002,297,856
3Apr 28, 2026 08:14107,52755,594,73837,796,0001,989,0002,371,584
4Apr 28, 2026 08:14107,54854,717,06034,819,0004,974,0002,371,584
5Apr 28, 2026 08:14107,58359,021,46736,821,0002,985,0002,371,584
6Apr 28, 2026 08:14107,73754,002,56337,870,0001,993,0002,379,776
7Apr 28, 2026 08:14107,81357,291,13437,897,0001,994,0002,367,488
8Apr 28, 2026 08:14108,24556,554,52439,050,0001,001,0002,441,216
9Apr 28, 2026 08:14108,68954,621,18038,205,0002,010,0002,428,928