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 9, 2021 13:06MaratMaratScore: 456,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2021 13:06455,2703,847,045,1573,778,738,10002,199,552
2Aug 9, 2021 06:49455,7853,855,920,2113,783,017,70102,256,896
3Aug 9, 2021 06:49455,9233,848,235,6033,784,159,08602,199,552
4Aug 9, 2021 13:06456,7323,854,705,5783,790,871,68102,195,456
5Aug 9, 2021 06:49459,2473,868,679,6433,811,752,30402,224,128
6Aug 9, 2021 13:06461,7963,893,834,8733,832,908,23602,195,456