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 11:32wnwnError
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 11:320743,632,885733,142,0001,010,0002,113,536expected "53689864422341378 ", got "18446744073709551023 53689864422341378 524137896 0 9990 9993 10007 10008 9993 10008 10013 10010 26114 26111 26091 26126 26118 26150 "
2Sep 24, 2026 11:320742,854,294730,559,0001,090,0002,113,536expected "53682530436126401 ", got "18446744073709551023 53682530436126401 524128486 0 9997 9997 10009 10007 9981 10028 10054 10011 26036 26021 26020 26037 26060 26107 "
3Sep 24, 2026 11:320743,269,043733,447,0001,019,0002,113,536expected "53686174567236439 ", got "18446744073709551023 53686174567236439 524127819 0 10000 10000 10007 9999 10010 10004 10003 10012 26180 26179 26176 26192 26198 26201 "