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 4, 2026 16:12caandocaandoScore: 6,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 16:126,33481,559,81051,563,0001,011,0002,269,184
2Mar 4, 2026 16:126,36279,965,82951,812,000996,0002,527,232
3Mar 4, 2026 16:126,44075,863,65952,444,0001,008,0002,285,568
4Mar 4, 2026 16:126,45177,660,07953,544,00002,285,568
5Mar 4, 2026 16:126,50375,991,93351,973,0001,998,0002,285,568
6Mar 4, 2026 16:126,53378,933,50252,220,0002,008,0002,285,568