Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMar 20, 2026 13:53Dominique GarmierDominique GarmierScore: 8,620Success
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 13:578,514100,212,49768,648,0002,019,0002,404,352
2Mar 20, 2026 13:578,52198,426,98369,711,0001,010,0002,404,352
3Mar 20, 2026 13:578,53696,409,39368,852,0001,995,0002,408,448
4Mar 20, 2026 13:538,59197,406,68969,297,0002,008,0002,289,664
5Mar 20, 2026 13:578,62094,041,28971,546,00002,408,448
6Mar 20, 2026 13:538,648101,040,60368,791,0002,990,0002,265,088
7Mar 20, 2026 13:538,653100,020,58369,800,0002,023,0002,289,664
8Mar 20, 2026 13:578,65997,535,88169,873,0001,996,0002,428,928
9Mar 20, 2026 13:578,73293,162,86771,466,0001,006,0002,408,448