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 02:08Yuriy LyfenkoYuriy LyfenkoScore: 11,369Success
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 02:0811,357118,546,76292,255,0002,005,0002,289,664
2Jul 16, 2022 02:0811,358122,353,40492,267,0002,005,0002,289,664
3Jul 16, 2022 02:0811,360122,730,77894,289,00002,273,280
4Jul 16, 2022 02:0811,363117,217,26893,308,0001,003,0002,383,872
5Jul 16, 2022 02:0811,368117,817,58692,348,0002,007,0002,289,664
6Jul 16, 2022 02:0811,368119,547,07992,351,0002,007,0002,289,664
7Jul 16, 2022 02:0811,369122,229,23793,360,0001,003,0002,289,664
8Jul 16, 2022 02:0811,378118,163,71993,437,0001,004,0002,289,664
9Jul 16, 2022 02:0811,586126,711,27995,159,0001,001,0002,281,472
10Jul 16, 2022 02:0811,904184,263,10398,799,43502,273,280
11Jul 16, 2022 02:0811,904172,346,63798,805,80702,265,088
12Jul 16, 2022 02:0811,904166,131,13198,807,34802,277,376