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 11:48wnwnError
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 11:550748,528,081738,059,0001,100,0002,113,536expected "53689913552125835 ", got "18446744073709551026 53689913552125835 524132235 0 9997 10006 9997 9991 10073 10075 9992 9983 26280 26286 26276 26267 26483 26263 "
2Sep 24, 2026 11:550747,196,259737,386,0001,009,0002,113,536expected "53691064034770052 ", got "18446744073709551026 53691064034770052 524134247 0 9998 9995 10010 10003 10072 10083 10044 9994 26241 26244 26233 26255 26451 26298 "
3Sep 24, 2026 11:550746,387,518736,291,0001,060,0002,113,536expected "53682389790881743 ", got "18446744073709551026 53682389790881743 524129659 0 9995 9994 9986 9976 10065 10071 10006 10002 26215 26225 26211 26182 26401 26215 "