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 listSep 23, 2026 12:19Kevin HeaveyKevin HeaveyScore: 3,223Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 12:263,20535,587,27725,586,0001,022,00020,480
2Sep 23, 2026 12:263,20935,570,49525,585,0001,054,00020,480
3Sep 23, 2026 12:263,22135,748,98425,707,0001,034,00020,480
4Sep 23, 2026 12:263,22335,746,63625,686,0001,066,00020,480
5Sep 23, 2026 12:263,22335,788,46425,679,0001,078,00020,480
6Sep 23, 2026 12:263,22535,782,29625,726,0001,046,00020,480
7Sep 23, 2026 12:263,22635,786,64525,698,0001,080,00020,480
8Sep 23, 2026 12:263,22735,489,97825,732,0001,059,00020,480
9Sep 23, 2026 12:263,24535,890,01525,914,0001,026,00020,480