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 listApr 27, 2026 02:33wnwnError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 02:33046,934,93127,935,0001,995,0002,498,560expected "53691538450178613 ", got "53691538450173283 "
2Apr 27, 2026 02:333,42046,123,82727,373,0001,013,0002,486,272
3Apr 27, 2026 02:333,43542,799,64727,498,0001,018,0002,482,176
4Apr 27, 2026 02:333,44745,129,05227,592,0001,021,0002,330,624
5Apr 27, 2026 02:333,45441,315,48427,649,0001,024,0002,482,176
6Apr 27, 2026 02:333,45643,471,61326,712,0001,978,0002,490,368
7Apr 27, 2026 02:333,53646,663,32528,338,0001,012,0002,490,368
8Apr 27, 2026 02:333,57442,212,24828,644,0001,023,0002,330,624
9Apr 27, 2026 02:333,61444,799,69928,968,0001,034,0002,330,624