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 listJun 12, 2021 20:53evgenikwtevgenikwtScore: 28,070Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2021 20:5327,566289,384,006228,801,23102,252,800
2Jun 12, 2021 20:5327,972294,340,930232,167,65202,256,896
3Jun 12, 2021 20:5327,974287,122,839232,182,39002,265,088
4Jun 12, 2021 20:5328,044261,733,056231,765,000998,0002,256,896
5Jun 12, 2021 20:5328,045261,011,271230,778,0001,998,0002,256,896
6Jun 12, 2021 20:5328,056260,674,471230,867,0001,998,0002,519,040
7Jun 12, 2021 20:5328,070258,980,972231,985,000999,0002,371,584
8Jun 12, 2021 20:5328,086260,376,862232,116,0001,000,0002,256,896
9Jun 12, 2021 20:5328,088260,234,341232,132,0001,000,0002,260,992
10Jun 12, 2021 20:5328,694267,885,079236,161,0002,001,0002,371,584
11Jun 12, 2021 20:5328,700265,970,949238,208,00002,371,584
12Jun 12, 2021 20:5328,715265,325,301237,334,0001,001,0002,260,992