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 19, 2022 01:46Yuriy LyfenkoYuriy LyfenkoScore: 7,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2022 01:467,25190,274,33258,177,0002,006,0002,326,528
2Sep 19, 2022 01:467,26290,300,68056,255,0004,018,0002,469,888
3Sep 19, 2022 01:467,27785,364,53957,381,0003,020,0002,338,816
4Sep 19, 2022 01:467,28485,852,48658,441,0002,015,0002,473,984
5Sep 19, 2022 01:467,28981,325,20356,466,0004,033,0002,400,256
6Sep 19, 2022 01:467,30384,518,63155,645,0004,968,0002,342,912
7Sep 19, 2022 01:467,33588,300,57154,895,0005,988,0002,383,872
8Sep 19, 2022 01:467,40688,536,78858,448,0003,023,0002,269,184
9Sep 19, 2022 01:467,464131,080,12661,947,62602,301,952
10Sep 19, 2022 01:467,49089,519,76456,153,0006,016,0002,416,640
11Sep 19, 2022 01:467,518140,399,27562,403,10302,183,168
12Sep 19, 2022 01:467,585131,007,89962,958,77202,273,280