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 listJan 17, 2022 06:40Yuriy LyfenkoYuriy LyfenkoScore: 27,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2022 06:4027,638284,121,610229,398,80202,224,128
2Jan 17, 2022 06:4027,641251,975,801227,421,0002,003,0002,519,040
3Jan 17, 2022 06:4027,643253,200,514228,432,0001,001,0002,527,232
4Jan 17, 2022 06:4027,643261,273,162227,437,0002,003,0002,326,528
5Jan 17, 2022 06:4027,646286,758,921229,458,77802,211,840
6Jan 17, 2022 06:4027,650284,471,406229,494,93602,215,936
7Jan 17, 2022 06:4027,654255,003,791227,523,0002,004,0002,392,064
8Jan 17, 2022 06:4027,679255,169,049226,742,0002,996,0002,326,528
9Jan 17, 2022 06:4027,679256,350,678226,742,0002,996,0002,318,336
10Jan 17, 2022 06:4027,680258,453,064227,745,0001,997,0002,326,528
11Jan 17, 2022 06:4027,681253,332,984227,757,0001,997,0002,326,528
12Jan 17, 2022 06:4027,684259,243,751226,779,0002,997,0002,527,232