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 listMar 17, 2026 14:54Yuriy LyfenkoYuriy LyfenkoScore: 8,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 14:548,36496,806,58461,373,0008,049,0002,482,176
2Mar 17, 2026 14:548,430101,013,20260,971,0008,995,0002,367,488
3Mar 17, 2026 14:548,43198,051,54959,983,0009,997,0002,486,272
4Mar 17, 2026 14:548,43794,600,03163,022,0007,002,0002,486,272
5Mar 17, 2026 14:548,48796,415,14661,384,0009,056,0002,478,080
6Mar 17, 2026 14:548,48797,345,05161,383,0009,056,0002,408,448