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 12:36wnwnScore: 3,537Success
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 12:363,39542,108,05927,138,0001,044,0002,490,368
2May 9, 2026 12:363,40943,055,69327,236,0001,064,0002,486,272
3May 9, 2026 12:363,47647,858,83827,792,0001,064,0002,482,176
4May 9, 2026 12:363,53744,121,64428,280,0001,085,0002,478,080
5May 9, 2026 12:363,53745,020,51128,301,0001,058,0002,490,368
6May 9, 2026 12:363,56944,284,38428,577,0001,049,0002,486,272
7May 9, 2026 12:363,57043,531,16828,564,0001,069,0002,482,176
8May 9, 2026 12:363,57344,741,17128,546,0001,113,0002,490,368
9May 9, 2026 12:363,58243,899,35728,676,0001,055,0002,494,464