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 listJan 2, 2023 16:06Yuriy LyfenkoYuriy LyfenkoScore: 8,073Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2023 16:067,84087,648,88160,064,0005,005,0002,502,656
2Jan 2, 2023 16:067,90291,852,50361,551,0004,036,0002,453,504
3Jan 2, 2023 16:067,92192,525,40063,755,0001,992,0002,293,760
4Jan 2, 2023 16:067,94493,129,30758,944,0006,993,0002,334,720
5Jan 2, 2023 16:067,95990,426,34361,053,0005,004,0002,297,856
6Jan 2, 2023 16:068,042131,888,38266,748,18802,240,512
7Jan 2, 2023 16:068,07394,664,41163,004,0004,000,0002,461,696
8Jan 2, 2023 16:068,140136,083,16967,561,20902,293,760
9Jan 2, 2023 16:068,17296,750,53064,835,0002,992,0002,506,752
10Jan 2, 2023 16:068,17392,675,58963,846,0003,990,0002,482,176
11Jan 2, 2023 16:068,174134,771,15067,842,32002,293,760
12Jan 2, 2023 16:068,28495,356,95764,773,0003,986,0002,514,944