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 22, 2026 05:30wnwnScore: 3,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 05:313,41844,332,61627,364,0001,013,0002,490,368
2Apr 22, 2026 05:313,42345,880,92027,401,0001,014,0002,486,272
3Apr 22, 2026 05:313,45546,972,18227,657,0001,024,0002,486,272
4Apr 22, 2026 05:313,48148,337,67126,902,0001,992,0002,478,080
5Apr 22, 2026 05:313,48947,209,14026,966,0001,997,0002,490,368
6Apr 22, 2026 05:313,57143,756,30328,620,0001,022,0002,482,176
7Apr 22, 2026 05:313,61344,107,39527,992,0001,999,0002,490,368
8Apr 22, 2026 05:313,61745,270,39328,024,0002,001,0002,478,080
9Apr 22, 2026 05:313,66046,753,18629,367,0001,012,0002,330,624