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 listDec 5, 2022 15:26Yuriy LyfenkoYuriy LyfenkoScore: 8,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2022 15:268,17492,254,37165,850,0001,995,0002,383,872
2Dec 5, 2022 15:268,20596,670,86065,097,0003,004,0002,396,160
3Dec 5, 2022 15:268,23391,839,99161,297,0007,034,0002,420,736
4Dec 5, 2022 15:268,28796,535,11765,789,0002,990,0002,371,584
5Dec 5, 2022 15:268,36191,513,95465,376,0004,023,0002,379,776
6Dec 5, 2022 15:268,37693,913,10666,499,0003,022,0002,269,184
7Dec 5, 2022 15:268,37795,291,22166,507,0003,023,0002,342,912
8Dec 5, 2022 15:268,44795,314,31268,109,0002,003,0002,473,984
9Dec 5, 2022 15:268,44893,193,35967,111,0003,004,0002,396,160
10Dec 5, 2022 15:268,728141,509,11472,444,89202,215,936
11Dec 5, 2022 15:268,743126,466,53272,566,45102,277,376
12Dec 5, 2022 15:268,809143,214,96873,113,20802,297,856