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:25wnwnScore: 3,512Success
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:263,38545,195,19727,048,0001,055,0002,478,080
2May 9, 2026 12:263,39343,918,62527,073,0001,092,0002,482,176
3May 9, 2026 12:263,39743,113,94527,149,0001,053,0002,486,272
4May 9, 2026 12:263,39943,286,78127,166,0001,052,0002,494,464
5May 9, 2026 12:263,51241,489,35728,102,0001,051,0002,482,176
6May 9, 2026 12:263,51541,493,07128,107,0001,071,0002,486,272
7May 9, 2026 12:263,53746,539,17228,301,0001,063,0002,486,272
8May 9, 2026 12:263,55944,749,95628,403,0001,142,0002,494,464
9May 9, 2026 12:263,56944,811,05828,557,0001,072,0002,490,368