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 26, 2024 00:49haiwwkeshaiwwkesScore: 174,977Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 26, 2024 00:49174,9191,476,266,5311,381,881,00069,943,0002,510,848
2Oct 26, 2024 00:49174,9531,478,373,5841,403,138,00048,969,0002,293,760
3Oct 26, 2024 00:49174,9621,475,667,8541,389,218,00062,964,0002,293,760
4Oct 26, 2024 00:49174,9621,475,713,9961,384,225,00067,961,0002,510,848
5Oct 26, 2024 00:49174,9771,474,818,7091,385,339,00066,968,0002,289,664
6Oct 26, 2024 00:49174,9791,477,699,9501,376,360,00075,964,0002,506,752
7Oct 26, 2024 00:49174,9811,481,143,2031,386,372,00065,970,0002,293,760
8Oct 26, 2024 00:49175,0771,478,886,7341,382,179,00070,957,0002,514,944
9Oct 26, 2024 00:49186,9571,586,016,4551,488,752,00062,989,0002,293,760