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 22, 2025 19:03alfaixalfaixScore: 152,271Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2025 19:03152,1981,286,632,3121,261,246,0001,998,0002,277,376
2Feb 22, 2025 19:03152,2031,291,691,5311,261,286,0001,998,0002,281,472
3Feb 22, 2025 19:03152,2461,288,055,6401,261,642,0001,999,0002,289,664
4Feb 22, 2025 19:03152,2581,286,486,4741,262,745,000999,0002,277,376
5Feb 22, 2025 19:03152,2711,287,579,6501,262,850,000999,0002,281,472
6Feb 22, 2025 19:03152,2841,291,141,7401,262,962,000999,0002,289,664
7Feb 22, 2025 19:03152,3161,293,305,0221,262,226,0001,998,0002,289,664
8Feb 22, 2025 19:03152,3971,299,197,9461,263,896,000999,0002,277,376
9Feb 22, 2025 19:03153,1881,295,867,4281,269,462,0001,999,0002,281,472