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 listFeb 19, 2023 03:33MillyMillyScore: 352,008Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2023 03:33348,8172,960,472,1902,895,179,16702,256,896
2Feb 19, 2023 03:33352,0082,994,815,3652,921,663,56802,195,456
3Feb 19, 2023 03:33356,2233,019,521,2082,956,651,21102,195,456