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 listMar 28, 2024 13:03E SequeiraE SequeiraScore: 63,180Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2024 13:0363,126592,272,370523,942,19802,256,896
2Mar 28, 2024 13:0363,137590,906,614524,038,19202,285,568
3Mar 28, 2024 13:0563,156592,660,861524,198,52902,297,856
4Mar 28, 2024 13:0363,167582,557,572524,283,81202,297,856
5Mar 28, 2024 13:0363,180599,586,001524,396,20202,289,664
6Mar 28, 2024 13:0563,189578,330,559524,471,13402,297,856
7Mar 28, 2024 13:0363,224585,844,761524,761,12302,289,664
8Mar 28, 2024 13:0563,225591,231,658524,765,98202,285,568
9Mar 28, 2024 13:0363,229581,652,521524,801,83502,285,568