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 listMay 9, 2026 23:55Andrii StolitniiAndrii StolitniiScore: 85,714Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 23:5585,563725,654,855651,865,00058,311,0002,359,296
2May 9, 2026 23:5585,583726,882,435651,649,00058,691,0002,363,392
3May 9, 2026 23:5585,655728,299,293651,328,00059,613,0002,363,392
4May 9, 2026 23:5585,666729,683,977651,625,00059,406,0002,359,296
5May 9, 2026 23:5585,714726,169,831651,206,00060,226,0002,359,296
6May 9, 2026 23:5585,777729,350,209652,575,00059,382,0002,355,200
7May 9, 2026 23:5585,781726,316,660652,637,00059,349,0002,371,584
8May 9, 2026 23:5585,812729,327,940652,466,00059,778,0002,355,200
9May 9, 2026 23:5585,879728,126,816652,790,00060,008,0002,351,104