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, 2024 08:55mahdi739mahdi739Score: 139,108Success
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, 2024 08:55138,0661,169,472,8101,144,948,000999,0002,359,296
2Dec 21, 2024 08:55138,6461,179,765,8931,149,760,000999,0002,367,488
3Dec 21, 2024 08:55138,7571,174,245,1691,149,687,0001,999,0002,285,568
4Dec 21, 2024 08:55138,9431,183,633,0441,151,229,0001,998,0002,285,568
5Dec 21, 2024 08:55139,1081,177,567,6181,151,595,0002,998,0002,363,392
6Dec 21, 2024 08:55139,1961,184,674,2261,154,327,000999,0002,285,568
7Dec 21, 2024 08:55139,3311,188,391,3361,154,445,0001,999,0002,285,568
8Dec 21, 2024 08:55139,7861,186,678,7461,159,223,000999,0002,281,472
9Dec 21, 2024 08:55140,3461,192,264,7581,163,870,000999,0002,285,568