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 19:23wnwnError
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 19:240754,229,328743,228,0001,008,0002,113,536expected "53684520320149658 ", got "18446744073709551051 53684520320149658 524127590 0 9976 9998 10257 10073 10050 10053 9955 10002 26438 26399 26383 26845 26537 26394 "
2Sep 24, 2026 19:240744,581,987734,758,0001,064,0002,113,536expected "53696406674134785 ", got "18446744073709551051 53696406674134785 524137590 0 10004 10001 10106 10105 10047 10057 10001 10008 26182 26178 26180 26464 26330 26183 "
3Sep 24, 2026 19:240748,789,659738,355,0001,010,0002,113,536expected "53692302909222084 ", got "18446744073709551051 53692302909222084 524130817 0 9992 9997 10123 10118 10041 10079 9976 10009 26255 26213 26209 26535 26415 26221 "