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 12, 2024 10:05asssasssScore: 439,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2024 10:05439,4423,672,684,2373,587,396,00059,973,0002,506,752
2Sep 12, 2024 10:05439,5253,674,159,2703,569,101,00078,957,0002,285,568
3Sep 12, 2024 10:05439,5503,676,871,1243,563,302,00084,959,0002,285,568
4Sep 12, 2024 10:05439,6143,678,726,2443,578,822,00069,976,0002,285,568
5Sep 12, 2024 10:05439,6163,684,082,2703,575,858,00072,956,0002,293,760
6Sep 12, 2024 10:05439,8663,675,501,0373,574,931,00075,956,0002,293,760
7Sep 12, 2024 10:05444,7803,716,270,3953,626,697,00064,976,0002,285,568
8Sep 12, 2024 10:05445,9633,729,547,4013,622,529,00078,967,0002,510,848
9Sep 12, 2024 10:05446,2233,733,764,1013,634,674,00068,974,0002,293,760