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 23, 2023 16:15Alexander KrivolapovAlexander KrivolapovScore: 20,165Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2023 16:1519,720250,064,806163,675,81702,224,128
2Dec 23, 2023 16:1519,748240,635,855163,909,38402,224,128
3Dec 23, 2023 16:1519,759244,023,601163,998,02802,236,416
4Dec 23, 2023 16:1520,050192,162,186165,410,0001,002,0002,326,528
5Dec 23, 2023 16:1520,116199,429,219164,965,0001,999,0002,473,984
6Dec 23, 2023 16:1520,140189,920,435165,158,0002,001,0002,490,368
7Dec 23, 2023 16:1520,165194,182,732167,369,00002,326,528
8Dec 23, 2023 16:1520,286189,715,337166,367,0002,004,0002,473,984
9Dec 23, 2023 16:1520,290193,916,479168,403,00002,482,176
10Dec 23, 2023 16:1520,296192,988,060167,455,0001,002,0002,519,040
11Dec 23, 2023 16:1520,302194,307,503167,506,0001,003,0002,523,136
12Dec 23, 2023 16:1520,351195,520,118165,917,0002,998,0002,519,040