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 14:13wnwnScore: 3,406Success
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 14:133,37942,485,34627,011,0001,040,0002,490,368
2May 9, 2026 14:133,38643,442,62827,048,0001,062,0002,490,368
3May 9, 2026 14:133,38743,936,69427,033,0001,087,0002,486,272
4May 9, 2026 14:133,39444,972,49527,112,0001,065,0002,490,368
5May 9, 2026 14:133,40642,882,46227,232,0001,042,0002,486,272
6May 9, 2026 14:133,40744,097,19227,212,0001,069,0002,494,464
7May 9, 2026 14:133,46446,899,64127,685,0001,069,0002,482,176
8May 9, 2026 14:133,52442,998,70428,196,0001,056,0002,478,080
9May 9, 2026 14:133,58944,772,66428,727,0001,064,0002,486,272