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 8, 2021 20:50AlexeyAlexeyScore: 701,996Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2021 20:50700,21818,361,728,8885,811,806,49802,236,416
2Sep 8, 2021 17:43701,10318,026,380,2015,819,156,09202,248,704
3Sep 8, 2021 17:43701,28518,448,656,1525,820,666,24602,330,624
4Sep 8, 2021 20:50701,99617,878,675,9985,826,568,34302,285,568
5Sep 8, 2021 17:43715,57817,862,598,9105,939,300,92202,224,128
6Sep 8, 2021 20:50750,97521,090,818,3116,233,089,93302,220,032