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 16, 2024 09:24Huy Duc LeHuy Duc LeScore: 13,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2024 09:2413,724174,063,504113,912,66702,293,760
2Feb 16, 2024 09:2413,758182,565,422114,193,58202,281,472
3Feb 16, 2024 09:2413,761176,893,924114,218,87802,289,664