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 listAug 19, 2023 23:00sliceteamsliceteamScore: 8,514Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2023 23:008,49393,117,82969,488,0001,007,0002,260,992
2Aug 19, 2023 23:008,49696,679,86169,512,0001,007,0002,260,992
3Aug 19, 2023 23:008,49791,773,68569,517,0001,007,0002,375,680
4Aug 19, 2023 23:008,49796,949,79269,520,0001,007,0002,260,992
5Aug 19, 2023 23:008,50495,988,50070,580,00002,387,968
6Aug 19, 2023 23:008,50798,771,10169,598,0001,008,0002,392,064
7Aug 19, 2023 23:008,50796,528,91870,604,00002,387,968
8Aug 19, 2023 23:008,51499,711,74369,656,0001,009,0002,260,992
9Aug 19, 2023 23:008,53095,544,52869,804,000997,0002,383,872
10Aug 19, 2023 23:008,53295,829,81569,817,000997,0002,523,136
11Aug 19, 2023 23:008,53397,044,50268,828,0001,995,0002,260,992
12Aug 19, 2023 23:008,56298,745,48369,064,0002,001,0002,260,992
13Aug 19, 2023 23:008,566140,908,03671,099,33902,269,184
14Aug 19, 2023 23:008,581140,261,87571,218,68902,273,280
15Aug 19, 2023 23:008,606133,378,23171,431,62402,269,184