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 listJan 12, 2023 12:20unsatcoreunsatcoreScore: 60,502Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2023 12:2060,499558,645,990502,144,33502,293,760
2Jan 12, 2023 12:2060,502553,952,427502,165,77602,289,664
3Jan 12, 2023 12:2060,511561,858,801502,239,23202,289,664