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 11, 2026 14:51caandocaandoScore: 5,043Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 11, 2026 14:514,97666,542,64540,293,0001,007,0002,285,568
2Mar 11, 2026 14:515,01471,850,35139,587,0002,030,0002,359,296
3Mar 11, 2026 14:515,03766,591,61139,819,0001,990,0002,285,568
4Mar 11, 2026 14:515,04369,869,24040,859,000996,0002,285,568
5Mar 11, 2026 14:515,05669,236,32840,967,000999,0002,285,568
6Mar 11, 2026 14:515,24276,067,48040,473,0003,035,0002,506,752