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 listMay 8, 2025 04:44nnScore: 346,874Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2025 04:44345,5842,899,260,0672,782,400,00085,950,0002,281,472
2May 8, 2025 04:44346,8742,901,117,0422,797,109,00081,944,0002,359,296
3May 8, 2025 04:44347,1082,901,775,3562,824,016,00056,980,0002,367,488