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 listMay 20, 2026 05:04M-RochatM-RochatScore: 48,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:0548,349409,104,789341,025,00060,274,0002,113,536
2May 20, 2026 05:0548,360409,195,770340,667,00060,729,0002,113,536
3May 20, 2026 05:0548,364410,849,743341,064,00060,362,0002,113,536
4May 20, 2026 05:0548,390411,211,380340,387,00061,256,0002,113,536
5May 20, 2026 05:0548,392409,533,012340,519,00061,137,0002,113,536
6May 20, 2026 05:0548,413411,478,423340,914,00060,916,0002,113,536
7May 20, 2026 05:0548,434409,814,958340,771,00061,234,0002,113,536
8May 20, 2026 05:0548,441411,555,703340,679,00061,388,0002,113,536
9May 20, 2026 05:0548,448413,867,339341,230,00060,895,0002,113,536