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 7, 2026 10:22wnwnScore: 3,391Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:233,37845,229,33026,984,0001,057,0002,486,272
2May 7, 2026 10:233,38042,750,55126,992,0001,063,0002,486,272
3May 7, 2026 10:233,38746,232,24727,046,0001,067,0002,490,368
4May 7, 2026 10:233,38745,178,21127,055,0001,059,0002,478,080
5May 7, 2026 10:233,39142,990,03927,095,0001,053,0002,486,272
6May 7, 2026 10:233,40843,322,12527,216,0001,078,0002,490,368
7May 7, 2026 10:233,41143,962,19627,230,0001,085,0002,490,368
8May 7, 2026 10:233,41543,563,06627,292,0001,056,0002,490,368
9May 7, 2026 10:233,55146,273,49428,369,0001,109,0002,482,176