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 1, 2025 20:02E SequeiraE SequeiraScore: 86,393Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 20:0286,302743,044,471658,366,00057,944,0002,469,888
2Feb 1, 2025 20:0286,393739,136,809672,060,00045,004,0002,461,696
3Feb 1, 2025 20:0286,462745,876,108653,666,00063,967,0002,469,888