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 11, 2024 20:45MatthiasMatthiasScore: 8,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2024 20:458,64896,883,78669,782,0001,993,0002,269,184
2Dec 11, 2024 20:458,66898,324,91769,945,0001,998,0002,285,568
3Dec 11, 2024 20:458,67396,841,53569,986,0001,999,0002,265,088
4Dec 11, 2024 20:458,67693,584,59970,010,0002,000,0002,519,040
5Dec 11, 2024 20:458,68399,311,36270,065,0002,001,0002,531,328
6Dec 11, 2024 20:458,82894,488,78371,269,0002,007,0002,285,568