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 listAug 2, 2026 13:25CodeReclaimersCodeReclaimersScore: 6,998Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 13:266,88667,166,59555,952,0001,206,0002,113,536
2Aug 2, 2026 13:266,89267,211,03456,010,0001,199,0002,113,536
3Aug 2, 2026 13:266,95067,710,37756,491,0001,202,0002,113,536
4Aug 2, 2026 13:266,95967,713,55356,561,0001,205,0002,113,536
5Aug 2, 2026 13:266,99868,187,48357,078,0001,011,0002,113,536
6Aug 2, 2026 13:267,01869,058,47057,043,0001,210,0002,113,536
7Aug 2, 2026 13:267,10268,944,99157,766,0001,188,0002,113,536
8Aug 2, 2026 13:267,24671,059,60259,131,0001,012,0002,113,536
9Aug 2, 2026 13:267,33070,819,21059,649,0001,198,0002,113,536