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 19:38wnwnError
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 19:380747,679,458737,175,0001,017,0002,113,536expected "53693295626398662 ", got "18446744073709551052 53693295626398662 524133882 0 9994 9995 10009 10000 10013 10012 9992 9994 26257 26254 26246 26272 26284 26239 "
2Sep 24, 2026 19:380743,406,970733,447,0001,104,0002,113,536expected "53685491034118167 ", got "18446744073709551052 53685491034118167 524125937 0 10001 10001 9994 10006 10008 10040 9994 10004 26174 26157 26168 26177 26229 26156 "
3Sep 24, 2026 19:380747,969,033736,945,0001,041,0002,113,536expected "53689259038186397 ", got "18446744073709551052 53689259038186397 524130966 0 9993 9997 9991 10010 9989 10000 10003 10007 26301 26281 26289 26295 26282 26290 "