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 listSep 22, 2024 20:13Павел РатмановПавел РатмановScore: 50,181Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2024 20:1350,113440,256,282353,946,00061,990,0002,330,624
2Sep 22, 2024 20:1350,143445,061,394358,297,00057,886,0002,330,624
3Sep 22, 2024 20:1350,170441,896,714362,355,00054,053,0002,289,664
4Sep 22, 2024 20:1350,177442,820,634361,411,00055,062,0002,289,664
5Sep 22, 2024 20:1350,181444,198,184362,570,00053,936,0002,330,624
6Sep 22, 2024 20:1350,198445,977,352356,694,00059,948,0002,289,664
7Sep 22, 2024 20:1350,242447,799,845358,007,00059,001,0002,281,472
8Sep 22, 2024 20:1350,271441,292,600356,211,00061,036,0002,326,528
9Sep 22, 2024 20:1350,282443,732,832360,294,00057,046,0002,326,528