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 listJul 16, 2022 05:40Yuriy LyfenkoYuriy LyfenkoScore: 11,214Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2022 05:4011,206119,711,99892,008,0001,000,0002,289,664
2Jul 16, 2022 05:4011,206116,008,52092,012,0001,000,0002,265,088
3Jul 16, 2022 05:4011,209117,450,91892,037,0001,000,0002,535,424
4Jul 16, 2022 05:4011,212118,019,46791,056,0002,001,0002,273,280
5Jul 16, 2022 05:4011,213116,821,01691,070,0002,001,0002,289,664
6Jul 16, 2022 05:4011,214114,619,84491,074,0002,001,0002,289,664
7Jul 16, 2022 05:4011,214121,174,10191,072,0002,001,0002,289,664
8Jul 16, 2022 05:4011,217115,529,89691,101,0002,002,0002,289,664
9Jul 16, 2022 05:4011,217116,470,30991,103,0002,002,0002,289,664
10Jul 16, 2022 05:4012,030163,303,37999,845,41802,277,376
11Jul 16, 2022 05:4012,031167,591,46199,858,73502,265,088
12Jul 16, 2022 05:4012,037163,721,84399,909,44902,277,376