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 listNov 6, 2024 09:58Alexander KosachevAlexander KosachevScore: 1,828,831Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 09:581,816,47815,109,404,30615,005,795,00070,970,0002,281,472
2Nov 6, 2024 09:581,817,57815,122,584,61915,023,922,00061,974,0002,281,472
3Nov 6, 2024 09:581,825,09015,177,210,48615,075,275,00072,972,0002,281,472
4Nov 6, 2024 09:581,826,57415,193,404,78315,096,600,00063,968,0002,281,472
5Nov 6, 2024 09:581,828,83115,212,630,65915,120,321,00058,973,0002,293,760
6Nov 6, 2024 09:581,829,17415,215,774,05515,116,177,00065,970,0002,281,472
7Nov 6, 2024 09:581,830,38415,226,768,19715,120,223,00071,967,0002,281,472
8Nov 6, 2024 09:581,832,80115,249,636,98615,155,281,00056,970,0002,514,944
9Nov 6, 2024 09:582,011,28816,733,953,47116,617,729,00075,962,0002,281,472