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 05:45wnwnScore: 3,494Success
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 05:453,41544,507,16827,337,0001,012,0002,330,624
2Apr 27, 2026 05:453,46043,502,32126,744,0001,981,0002,555,904
3Apr 27, 2026 05:453,46247,454,68827,712,0001,026,0002,478,080
4Apr 27, 2026 05:453,46748,754,71626,797,0001,984,0002,473,984
5Apr 27, 2026 05:453,49443,573,73127,006,0002,000,0002,486,272
6Apr 27, 2026 05:453,51042,408,48828,136,0001,004,0002,486,272
7Apr 27, 2026 05:453,59043,767,62027,815,0001,986,0002,490,368
8Apr 27, 2026 05:453,59748,501,70727,869,0001,990,0002,330,624
9Apr 27, 2026 05:453,65248,452,54229,304,0001,010,0002,482,176