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 listNov 4, 2025 17:52caandocaandoScore: 5,995Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 17:525,88077,845,72346,810,0001,991,0002,265,088
2Nov 4, 2025 17:525,91770,478,63248,110,0001,002,0002,285,568
3Nov 4, 2025 17:525,92273,238,52147,147,0002,006,0002,519,040
4Nov 4, 2025 17:525,99575,221,61848,766,000995,0002,269,184
5Nov 4, 2025 17:526,01473,707,57447,919,0001,996,0002,265,088
6Nov 4, 2025 17:526,07372,958,04549,402,0001,008,0002,514,944