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 30, 2022 01:58Alexander KimAlexander KimScore: 22,061Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2022 01:5822,024208,204,143181,798,0001,004,0002,383,872
2Dec 30, 2022 01:5822,039212,003,578179,929,0002,998,0002,326,528
3Dec 30, 2022 01:5822,046264,198,601182,979,91802,203,648
4Dec 30, 2022 01:5822,051210,274,458181,022,0002,000,0002,326,528
5Dec 30, 2022 01:5822,058257,717,919183,081,81702,203,648
6Dec 30, 2022 01:5822,059251,340,386183,088,03602,199,552
7Dec 30, 2022 01:5822,061205,502,926180,106,0003,001,0002,326,528
8Dec 30, 2022 01:5822,062203,751,287182,117,0001,000,0002,326,528
9Dec 30, 2022 01:5822,077208,101,523181,241,0002,002,0002,383,872
10Dec 30, 2022 01:5822,088207,742,270180,323,0003,005,0002,326,528
11Dec 30, 2022 01:5822,092206,906,738180,360,0003,006,0002,375,680
12Dec 30, 2022 01:5822,099211,155,990182,417,0001,002,0002,326,528