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 04:48evgenikwtevgenikwtScore: 28,476Success
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 04:4828,409261,461,116234,795,000999,0002,260,992
2Jun 12, 2021 04:4828,411263,909,626234,809,000999,0002,519,040
3Jun 12, 2021 04:4828,417266,242,481233,867,0001,998,0002,260,992
4Jun 12, 2021 04:4828,447258,934,297235,110,0001,000,0002,375,680
5Jun 12, 2021 04:4828,457265,966,266234,191,0002,001,0002,379,776
6Jun 12, 2021 04:4828,466259,466,575235,270,0001,001,0002,519,040
7Jun 12, 2021 04:4828,476264,125,921234,360,0001,994,0002,383,872
8Jun 12, 2021 04:4828,519263,472,754235,708,000998,0002,519,040
9Jun 12, 2021 04:4828,526266,799,263235,765,000999,0002,383,872
10Jun 12, 2021 04:4828,795302,631,423238,997,12602,265,088
11Jun 12, 2021 04:4828,816299,712,562239,169,07402,260,992
12Jun 12, 2021 04:4828,862300,267,319239,553,32802,248,704