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 24, 2024 11:40Sean DewarSean DewarScore: 75,251Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2024 11:4075,121649,869,847622,504,000999,0002,289,664
2Dec 24, 2024 11:4075,153655,118,041621,773,0001,999,0002,281,472
3Dec 24, 2024 11:4075,172655,998,644621,930,0001,999,0002,269,184
4Dec 24, 2024 11:4075,251653,283,431623,587,0001,000,0002,289,664
5Dec 24, 2024 11:4075,254652,530,560622,612,0001,998,0002,289,664
6Dec 24, 2024 11:4076,368662,537,618631,854,0001,999,0002,289,664