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 listOct 23, 2025 20:06caandocaandoScore: 6,029Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 23, 2025 20:065,86673,885,74646,704,0001,987,0002,523,136
2Oct 23, 2025 20:065,89170,245,29046,904,0001,995,0002,523,136
3Oct 23, 2025 20:065,91771,530,71947,105,0002,004,0002,285,568
4Oct 23, 2025 20:066,02975,567,90948,042,0002,001,0002,506,752
5Oct 23, 2025 20:066,03675,754,09148,095,0002,003,0002,285,568
6Oct 23, 2025 20:066,03978,210,69948,121,0002,005,0002,265,088