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 listMar 20, 2026 23:16olliecrowolliecrowScore: 102,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 23:15100,63068,548,15035,221,0002,012,0002,396,160
2Mar 20, 2026 23:12101,23862,692,12334,421,0003,037,0002,400,256
3Mar 20, 2026 23:12101,77360,408,54335,621,0002,035,0002,502,656
4Mar 20, 2026 23:12102,23566,865,75134,841,0002,986,0002,342,912
5Mar 20, 2026 23:16102,25763,486,45436,840,000995,0002,535,424
6Mar 20, 2026 23:13102,27064,164,77135,849,0001,991,0002,424,832
7Mar 20, 2026 23:13102,30565,040,43335,861,0001,992,0002,342,912
8Mar 20, 2026 23:15102,53865,834,28935,943,0001,996,0002,334,720
9Mar 20, 2026 23:16102,66862,958,39435,988,0001,999,0002,326,528
10Mar 20, 2026 23:13102,73870,994,34935,012,0003,001,0002,342,912
11Mar 20, 2026 23:16104,57871,545,78537,676,0001,018,0002,342,912
12Mar 20, 2026 23:15104,69766,479,90136,700,0002,038,0002,351,104