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 19, 2022 16:18Dmitry DolgopolovDmitry DolgopolovScore: 27,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2022 16:1827,584252,515,295226,948,0001,999,0002,285,568
2Dec 19, 2022 16:1827,588254,783,393226,985,0001,999,0002,285,568
3Dec 19, 2022 16:1827,596254,778,362227,049,0002,000,0002,277,376
4Dec 19, 2022 16:1827,597260,036,105228,052,0001,000,0002,269,184
5Dec 19, 2022 16:1827,599250,928,211227,069,0002,000,0002,285,568
6Dec 19, 2022 16:1827,601253,079,001227,091,0002,000,0002,285,568
7Dec 19, 2022 16:1827,610250,912,266227,165,0002,001,0002,269,184
8Dec 19, 2022 16:1827,610254,655,160227,162,0002,001,0002,285,568
9Dec 19, 2022 16:1827,611252,798,894228,170,0001,000,0002,269,184
10Dec 19, 2022 16:1827,709299,328,628229,986,15402,256,896
11Dec 19, 2022 16:1827,715303,285,981230,037,83202,289,664
12Dec 19, 2022 16:1827,730289,583,759230,157,95602,289,664