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 15:58wnwnError
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 15:59065,110,47754,605,0001,029,0002,113,536expected "53688637788868094 ", got "18446744073709551041 53688637788868094 524127333 0 127 296268 206190 570114 1103735 1604869 2167074 2145542 141967 138468 271604 556155 1111994 2168686 2132297 "
2Sep 24, 2026 15:59064,321,68054,463,0001,021,0002,113,536expected "53688089648753553 ", got "18446744073709551041 53688089648753553 524129458 0 127 274202 198854 303818 943087 2161715 2149133 2107172 143210 134346 263201 547277 1077042 2131293 2098924 "
3Sep 24, 2026 15:59062,719,66952,954,0001,013,0002,113,536expected "53686664414243177 ", got "18446744073709551041 53686664414243177 524134416 0 127 186297 174398 308800 551402 1102580 2207218 2120698 148413 141356 274471 553419 1098900 2201731 2104441 "