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 25, 2026 19:55Dominique GarmierDominique GarmierScore: 39,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 02:4239,810356,143,405329,419,0001,001,0002,478,080
2Mar 28, 2026 02:4239,825355,001,917328,550,0001,997,0002,482,176
3Mar 28, 2026 02:4239,841352,467,697328,685,0001,998,0002,486,272
4Mar 25, 2026 19:5539,872358,557,541328,939,0001,999,0002,482,176
5Mar 25, 2026 19:5539,907356,984,193330,229,0001,000,0002,277,376
6Mar 25, 2026 19:5539,908355,323,108330,236,0001,000,0002,277,376