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 13:05wnwnScore: 3,571Success
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 13:063,38143,953,24627,010,0001,058,0002,490,368
2May 9, 2026 13:063,55446,934,91128,435,0001,069,0002,490,368
3May 9, 2026 13:063,56742,567,65828,544,0001,070,0002,478,080
4May 9, 2026 13:063,57044,414,26828,588,0001,045,0002,490,368
5May 9, 2026 13:063,57144,567,97428,541,0001,100,0002,482,176
6May 9, 2026 13:063,57944,502,21528,629,0001,082,0002,490,368
7May 9, 2026 13:063,58043,189,93528,629,0001,087,0002,486,272
8May 9, 2026 13:063,58144,825,24528,658,0001,071,0002,486,272
9May 9, 2026 13:063,60045,900,63828,788,0001,100,0002,482,176