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 listFeb 27, 2024 11:41Sergey KunitsynSergey KunitsynScore: 256,588Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 27, 2024 11:41256,5732,186,420,6512,129,553,52102,297,856
2Feb 27, 2024 11:41256,5882,187,349,8542,129,682,73502,174,976
3Feb 27, 2024 11:41256,6282,182,530,1952,130,009,46002,297,856