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 01:20evgenikwtevgenikwtScore: 28,575Success
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 01:2028,519264,910,819235,707,000998,0002,260,992
2Jun 12, 2021 01:2028,519266,602,402234,714,0001,997,0002,519,040
3Jun 12, 2021 01:2028,535267,148,813234,846,0001,998,0002,387,968
4Jun 12, 2021 01:2028,538263,780,532235,863,000999,0002,260,992
5Jun 12, 2021 01:2028,555265,752,344236,009,0001,000,0002,260,992
6Jun 12, 2021 01:2028,570266,276,946235,126,0002,001,0002,265,088
7Jun 12, 2021 01:2028,575262,296,016237,175,00002,473,984
8Jun 12, 2021 01:2028,579268,073,859236,209,0001,000,0002,519,040
9Jun 12, 2021 01:2028,594295,227,146237,326,40902,252,800
10Jun 12, 2021 01:2028,599259,863,035237,372,00002,260,992
11Jun 12, 2021 01:2028,649301,542,935237,789,26402,260,992
12Jun 12, 2021 01:2029,031295,720,947240,959,01802,256,896