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 20:01wnwnError
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 20:020746,261,536736,454,0001,029,0002,113,536expected "53676448817571415 ", got "18446744073709551053 53676448817571415 524124719 0 10000 9995 10071 10066 10159 10172 10000 9992 26170 26163 26153 26341 26618 26157 "
2Sep 24, 2026 20:020746,808,502737,039,0001,046,0002,113,536expected "53686894570928621 ", got "18446744073709551053 53686894570928621 524130235 0 9999 9999 10056 10055 10185 10183 10002 10000 26234 26228 26239 26384 26708 26227 "
3Sep 24, 2026 20:020748,639,897738,110,0001,038,0002,113,536expected "53691657995672506 ", got "18446744073709551053 53691657995672506 524135815 0 10014 9984 10131 10078 10147 10303 10005 9998 26210 26204 26217 26478 26801 26201 "