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 13, 2025 19:48Tony SolomonikTony SolomonikScore: 77,059Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2025 19:4877,049665,540,519575,559,00063,951,0002,420,736
2Sep 13, 2025 19:4877,059669,108,215569,632,00069,954,0002,433,024
3Sep 13, 2025 19:4877,126665,559,202563,126,00077,017,0002,285,568