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 6, 2023 02:42Yuriy LyfenkoYuriy LyfenkoScore: 7,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2023 02:427,20487,671,42156,808,0002,989,0002,498,560
2Dec 6, 2023 02:427,20586,095,23858,802,000996,0002,359,296
3Dec 6, 2023 02:427,22386,257,18455,954,0003,996,0002,445,312
4Dec 6, 2023 02:427,22587,179,57556,968,0002,998,0002,297,856
5Dec 6, 2023 02:427,25883,924,14455,220,0005,020,0002,420,736
6Dec 6, 2023 02:427,26386,785,79455,258,0005,023,0002,510,848
7Dec 6, 2023 02:427,28484,337,74656,424,0004,030,0002,514,944
8Dec 6, 2023 02:427,32593,805,37855,817,0004,983,0002,506,752
9Dec 6, 2023 02:427,32886,627,47756,834,0003,988,0002,359,296
10Dec 6, 2023 02:427,443131,548,47361,775,46202,207,744
11Dec 6, 2023 02:427,457123,002,00261,892,52902,240,512
12Dec 6, 2023 02:427,471115,002,00962,006,32502,232,320