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 8, 2026 07:25caandocaandoScore: 9,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 07:258,395100,039,10068,668,0001,009,0002,285,568
2Mar 8, 2026 07:258,41193,560,47368,814,000997,0002,269,184
3Mar 8, 2026 07:258,41991,167,01468,881,000998,0002,285,568
4Mar 8, 2026 07:259,362102,324,59376,692,0001,009,0002,523,136
5Mar 8, 2026 07:259,373102,335,25676,801,000997,0002,265,088
6Mar 8, 2026 07:259,375105,512,90275,819,0001,995,0002,285,568