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:09wnwnError
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:090778,331,104767,782,0001,021,0002,113,536expected "53689842640425434 ", got "18446744073709551021 53689842640425434 25296165658 524134682 0 10003 10009 10407 10250 10262 10401 10020 9999 26253 26238 26290 27316 26905 "
2Sep 24, 2026 11:090780,282,893768,447,0001,083,0002,113,536expected "53687916686087689 ", got "18446744073709551021 53687916686087689 25296043005 524133791 0 9999 10019 10437 10265 10268 10447 10010 10021 26252 26253 26302 27419 26943 "
3Sep 24, 2026 11:090780,082,064770,175,0001,009,0002,113,536expected "53689998553135409 ", got "18446744073709551021 53689998553135409 25296072334 524132018 0 10013 10016 10410 10246 10255 10402 10040 9998 26328 26320 26409 27389 26978 "