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 29, 2026 13:11TudyMTudyMScore: 34,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 13:1134,527306,121,609286,581,00002,392,064
2Apr 29, 2026 13:1134,602303,521,323286,199,0001,000,0002,387,968
3Apr 29, 2026 13:1134,611305,560,406286,279,0001,000,0002,306,048
4Apr 29, 2026 13:1134,612305,002,296285,280,0002,001,0002,367,488
5Apr 29, 2026 13:1134,614305,657,548286,294,0001,004,0002,379,776
6Apr 29, 2026 13:1134,624309,019,574286,381,0001,001,0002,375,680
7Apr 29, 2026 13:1134,625306,143,426285,393,0002,002,0002,306,048
8Apr 29, 2026 13:1134,639306,831,031284,514,0002,994,0002,306,048
9Apr 29, 2026 13:1134,642304,867,908286,531,0001,001,0002,379,776