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 listSep 6, 2022 16:29Bernard TeoBernard TeoScore: 18,323Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2022 16:2918,309180,045,094149,967,0001,999,0002,404,352
2Sep 6, 2022 16:2918,310171,179,130150,976,000999,0002,408,448
3Sep 6, 2022 16:2918,313183,281,484152,001,00002,273,280
4Sep 6, 2022 16:2918,316174,470,541150,020,0002,000,0002,396,160
5Sep 6, 2022 16:2918,320179,080,076150,057,0002,000,0002,400,256
6Sep 6, 2022 16:2918,321184,161,192150,067,0002,000,0002,273,280
7Sep 6, 2022 16:2918,323174,727,617150,077,0002,001,0002,273,280
8Sep 6, 2022 16:2918,325175,095,286151,100,0001,000,0002,510,848
9Sep 6, 2022 16:2918,357175,290,314152,359,00002,273,280
10Sep 6, 2022 16:2918,528215,678,401153,779,78302,285,568
11Sep 6, 2022 16:2918,534211,948,278153,835,08102,281,472
12Sep 6, 2022 16:2918,537208,829,142153,858,63702,285,568