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:14wnwnScore: 3,455Success
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,39649,992,34326,179,0002,013,0002,482,176
2Apr 26, 2026 16:143,41746,521,47327,351,0001,013,0002,482,176
3Apr 26, 2026 16:143,42141,724,47527,381,0001,014,0002,330,624
4Apr 26, 2026 16:143,45443,870,67327,652,0001,024,0002,490,368
5Apr 26, 2026 16:143,45542,820,95227,653,0001,024,0002,486,272
6Apr 26, 2026 16:143,45741,847,96927,675,0001,025,0002,482,176
7Apr 26, 2026 16:143,49145,149,82426,982,0001,998,0002,498,560
8Apr 26, 2026 16:143,60344,606,46027,918,0001,994,0002,490,368
9Apr 26, 2026 16:143,60348,031,78728,915,000997,0002,490,368