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 11, 2024 14:06ndbnndbnScore: 124,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 14:06123,8981,052,293,905954,398,00073,953,0002,486,272
2Nov 11, 2024 14:06123,9131,053,211,001944,519,00083,957,0002,273,280
3Nov 11, 2024 14:06123,9411,057,020,616960,729,00067,980,0002,281,472
4Nov 11, 2024 14:06123,9991,051,361,650936,263,00092,926,0002,281,472
5Nov 11, 2024 14:06124,0001,050,979,013939,269,00089,930,0002,281,472
6Nov 11, 2024 14:06124,0431,049,075,616943,595,00085,963,0002,281,472
7Nov 11, 2024 14:06124,0811,051,606,537967,878,00061,992,0002,486,272
8Nov 11, 2024 14:06124,1491,053,658,723939,484,00090,950,0002,273,280
9Nov 11, 2024 14:06124,1721,055,817,368954,654,00075,972,0002,490,368