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 12:53wnwnError
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 13:010795,676,554774,153,00012,742,0002,113,536expected "53687447897599929 ", got "18446744073709551032 53687447897599929 25295851496 524128239 0 9997 10005 10058 10173 10165 10044 10010 10024 26593 26587 26623 26724 27025 "
2Sep 24, 2026 13:010801,612,362779,262,00013,014,0002,113,536expected "53692611510845149 ", got "18446744073709551032 53692611510845149 25296329397 524139140 0 10004 10011 10051 10165 10155 10057 10015 10004 26767 26763 26799 26910 27195 "
3Sep 24, 2026 13:010811,856,728787,778,00013,283,0002,113,536expected "53690269823669594 ", got "18446744073709551032 53690269823669594 25296100105 524132887 0 9999 9977 10054 10131 10136 10037 10002 10019 27114 27101 27099 27209 27470 "