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 08: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 08:090987,677,595977,573,0001,100,0002,113,536expected "53685070916946556 ", got "18446744073709551003 53685070916946556 524130088 0 9997 10184 10189 10259 10085 10304 10315 10069 10271 10162 10179 10119 26254 26269 "
2Sep 24, 2026 08:090988,655,311978,736,0001,069,0002,113,536expected "53687336941037258 ", got "18446744073709551003 53687336941037258 524132301 0 9990 10187 10138 10259 10063 10323 10338 10053 10257 10154 10186 10004 26314 26298 "
3Sep 24, 2026 08:090989,915,421980,133,0001,032,0002,113,536expected "53683422390138891 ", got "18446744073709551003 53683422390138891 524127006 0 10092 10138 10188 10232 10119 10304 10378 10084 10227 10169 10246 10004 26351 26304 "