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 3, 2022 17:29Xavier R. GuérinXavier R. GuérinScore: 114,453Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2022 17:29114,4031,016,478,855949,548,79702,281,472
2Dec 3, 2022 17:29114,4531,015,317,171949,959,09602,273,280
3Dec 3, 2022 17:29114,5231,008,807,535950,543,38202,281,472