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 listDec 21, 2021 23:11Yuriy LyfenkoYuriy LyfenkoScore: 35,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2021 23:1135,379372,501,823293,644,57702,277,376
2Dec 21, 2021 23:1135,379353,725,123293,641,66202,289,664
3Dec 21, 2021 23:1135,399344,965,092293,811,14902,277,376