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 16:33wnwnError
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 16:3301,000,527,245990,619,0001,004,0002,113,536expected "53683896185943679 ", got "18446744073709551043 53683896185943679 524126661 0 9988 10011 10066 10079 9965 10173 10002 9989 10517 10054 27160 29954 26155 26331 29448 29391 32765 "
2Sep 24, 2026 16:3301,031,970,1831,017,433,0001,099,0002,113,536expected "53686591434560125 ", got "18446744073709551043 53686591434560125 524130595 0 10041 10623 10139 9994 9999 9999 9997 10032 9988 9998 26274 30983 29471 29674 29436 29513 26267 "
3Sep 24, 2026 16:3301,014,197,966992,221,00013,048,0002,113,536expected "53690644980919335 ", got "18446744073709551043 53690644980919335 524132048 0 9996 9998 10069 10062 11318 10005 10009 9643 9982 9975 29903 27957 26215 26399 29718 30016 33870 "