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 listApr 1, 2023 21:46Yuriy LyfenkoYuriy LyfenkoScore: 7,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2023 21:467,22887,730,69755,996,0003,999,0002,400,256
2Apr 1, 2023 21:467,237129,132,92760,070,57702,191,360
3Apr 1, 2023 21:467,25088,049,39057,167,0003,008,0002,506,752
4Apr 1, 2023 21:467,25189,759,75058,175,0002,006,0002,265,088
5Apr 1, 2023 21:467,255122,336,67660,220,62502,306,048
6Apr 1, 2023 21:467,25781,799,88255,218,0005,019,0002,514,944
7Apr 1, 2023 21:467,272139,979,50860,355,09802,240,512
8Apr 1, 2023 21:467,27589,292,36458,368,0002,012,0002,473,984
9Apr 1, 2023 21:467,32785,438,93057,826,0002,991,0002,519,040
10Apr 1, 2023 21:467,34387,869,85057,953,0002,997,0002,301,952
11Apr 1, 2023 21:467,36583,845,29756,122,0005,010,0002,265,088
12Apr 1, 2023 21:467,37389,361,82557,184,0004,012,0002,342,912