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 listOct 11, 2023 19:25apuxbtapuxbtScore: 82,244Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2023 19:2582,102751,577,328681,449,07402,179,072
2Oct 11, 2023 19:2582,244743,711,625682,626,04702,306,048
3Oct 11, 2023 19:2582,287755,700,631682,984,65502,306,048