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 24, 2026 18:53wnwnError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 18:530746,461,148736,221,0001,057,0002,113,536expected "53685970378726205 ", got "18446744073709551050 53685970378726205 524129398 0 9995 9997 10011 10029 10041 10037 10002 9994 26268 26262 26249 26335 26368 26252 "
2Sep 24, 2026 18:530748,368,833737,904,0001,019,0002,113,536expected "53687848867379946 ", got "18446744073709551050 53687848867379946 524131675 0 9991 9992 10046 10031 10042 10034 9996 10001 26275 26274 26260 26378 26364 26275 "
3Sep 24, 2026 18:530748,194,346737,672,0001,034,0002,113,536expected "53682387051298168 ", got "18446744073709551050 53682387051298168 524126487 0 10013 9997 10021 10040 10050 10039 9997 9996 26260 26246 26266 26352 26369 26233 "