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 listAug 22, 2023 07:14matsuoka-601matsuoka-601Score: 25,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2023 07:1425,423235,577,278209,012,0002,000,0002,260,992
2Aug 22, 2023 07:1425,438234,172,218209,137,0002,001,0002,519,040
3Aug 22, 2023 07:1425,439231,473,861209,141,0002,001,0002,285,568
4Aug 22, 2023 07:1425,445238,754,093209,189,0002,001,0002,285,568
5Aug 22, 2023 07:1425,461233,754,301210,323,0001,001,0002,277,376
6Aug 22, 2023 07:1425,465233,239,802211,358,00002,265,088
7Aug 22, 2023 07:1425,469236,963,672210,388,0001,001,0002,285,568
8Aug 22, 2023 07:1425,474243,847,508210,435,0001,002,0002,519,040
9Aug 22, 2023 07:1425,475236,378,943210,438,0001,002,0002,519,040
10Aug 22, 2023 07:1425,609275,468,579212,552,71402,281,472
11Aug 22, 2023 07:1425,617280,038,794212,621,66502,277,376
12Aug 22, 2023 07:1425,642275,476,072212,827,26602,281,472