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:49Yuriy LyfenkoYuriy LyfenkoScore: 11,955Success
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:4911,934120,121,41297,053,0002,001,0002,277,376
2Jul 16, 2022 05:4911,938121,803,89998,087,0001,000,0002,277,376
3Jul 16, 2022 05:4911,938121,462,08297,087,0002,001,0002,285,568
4Jul 16, 2022 05:4911,939126,779,15597,091,0002,001,0002,273,280
5Jul 16, 2022 05:4911,942123,112,39797,117,0002,002,0002,285,568
6Jul 16, 2022 05:4911,945125,862,03097,142,0002,002,0002,273,280
7Jul 16, 2022 05:4911,955126,244,68297,223,0002,004,0002,285,568
8Jul 16, 2022 05:4911,956125,908,05897,233,0002,004,0002,277,376
9Jul 16, 2022 05:4911,995167,433,22199,555,19802,285,568
10Jul 16, 2022 05:4911,999164,664,73999,592,55602,281,472
11Jul 16, 2022 05:4912,267128,980,23599,822,0001,996,0002,285,568
12Jul 16, 2022 05:4912,302157,508,178102,105,24302,277,376