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 08:30wnwnScore: 3,565Success
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 08:303,39143,081,14827,071,0001,079,0002,482,176
2May 7, 2026 08:303,41143,959,99227,241,0001,071,0002,482,176
3May 7, 2026 08:303,41444,237,67127,279,0001,063,0002,486,272
4May 7, 2026 08:303,55945,324,17528,451,0001,089,0002,482,176
5May 7, 2026 08:303,56543,623,57428,504,0001,086,0002,478,080
6May 7, 2026 08:303,57745,232,03928,638,0001,053,0002,494,464
7May 7, 2026 08:303,58142,578,85628,635,0001,088,0002,490,368
8May 7, 2026 08:303,59546,415,21828,731,0001,109,0002,473,984
9May 7, 2026 08:303,59848,037,54628,773,0001,097,0002,482,176