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 30, 2021 23:37Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2021 23:3700000Error: died or killedstderr
2Jun 30, 2021 23:3800000Error: expected "53681011007917599 ", got "53681011007661599 "stderr
3Jun 30, 2021 23:3800000Error: died or killedstderr
4Jun 30, 2021 23:3900000Error: expected "53682757748266514 ", got "53682757722666514 "stderr
5Jun 30, 2021 23:4000000Error: died or killedstderr
6Jun 30, 2021 23:4100000Error: died or killedstderr
7Jun 30, 2021 23:4200000Error: expected "53689433253951243 ", got "53689430693951243 "stderr
8Jun 30, 2021 23:4200000Error: died or killedstderr
9Jun 30, 2021 23:3712,954416,429,922107,522,09702,236,416
10Jun 30, 2021 23:3712,958421,087,086107,555,47902,232,320
11Jun 30, 2021 23:3712,963425,403,398107,594,88602,240,512