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:39Yuriy LyfenkoYuriy LyfenkoScore: 27,367Success
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:3927,339255,250,795224,911,0001,999,0002,326,528
2Jan 17, 2022 06:3927,355257,377,942224,048,0003,000,0002,326,528
3Jan 17, 2022 06:3927,359253,734,160224,076,0003,001,0002,326,528
4Jan 17, 2022 06:3927,360260,335,629225,084,0002,000,0002,326,528
5Jan 17, 2022 06:3927,364281,454,713227,123,70002,215,936
6Jan 17, 2022 06:3927,365251,194,322224,127,0003,001,0002,519,040
7Jan 17, 2022 06:3927,367249,888,545225,146,0002,001,0002,326,528
8Jan 17, 2022 06:3927,368293,182,140227,150,43302,220,032
9Jan 17, 2022 06:3927,368304,533,504227,151,66602,224,128
10Jan 17, 2022 06:3927,385253,620,614225,294,0002,002,0002,527,232
11Jan 17, 2022 06:3927,385253,474,306224,291,0003,003,0002,326,528
12Jan 17, 2022 06:3927,388254,250,138225,318,0002,002,0002,523,136