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 26, 2026 16:13wnwnScore: 3,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 16:143,39646,367,75428,195,00002,490,368
2Apr 26, 2026 16:143,45643,176,50127,701,000989,0002,490,368
3Apr 26, 2026 16:143,46347,502,31226,765,0001,982,0002,490,368
4Apr 26, 2026 16:143,47252,023,98627,790,0001,029,0002,482,176
5Apr 26, 2026 16:143,58145,938,19927,745,0001,981,0002,490,368
6Apr 26, 2026 16:143,59049,453,73027,811,0001,986,0002,486,272
7Apr 26, 2026 16:143,61050,560,72927,968,0001,997,0002,478,080
8Apr 26, 2026 16:143,62149,096,86428,052,0002,003,0002,490,368
9Apr 26, 2026 16:143,63448,729,15229,161,0001,005,0002,486,272