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 29, 2022 12:39Jack FrigaardJack FrigaardScore: 5,987Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2022 12:395,948122,156,71649,366,04702,277,376
2Dec 29, 2022 12:415,951110,010,36949,393,06702,260,992
3Dec 29, 2022 12:405,956113,676,33649,438,26102,277,376
4Dec 29, 2022 12:415,965105,873,26149,508,60902,260,992
5Dec 29, 2022 12:425,970111,380,06749,547,57002,260,992
6Dec 29, 2022 12:405,974114,628,69349,583,11702,273,280
7Dec 29, 2022 12:425,987103,447,77949,692,14102,285,568
8Dec 29, 2022 12:426,001106,291,44649,806,45802,265,088
9Dec 29, 2022 12:416,002117,675,07749,817,34502,285,568
10Dec 29, 2022 12:396,040127,568,23650,133,70002,260,992
11Dec 29, 2022 12:406,046128,494,63050,185,30902,277,376
12Dec 29, 2022 12:396,079117,707,70250,453,46102,265,088