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 31, 2023 11:23unsatcoreunsatcoreScore: 13,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2023 11:2313,504134,220,846111,086,0001,000,0002,265,088
2Jan 31, 2023 11:2313,535133,320,467112,341,00002,277,376
3Jan 31, 2023 11:2313,543138,872,872111,403,0001,003,0002,277,376
4Jan 31, 2023 11:2313,559140,353,058111,536,0001,004,0002,277,376
5Jan 31, 2023 11:2313,560142,585,047111,541,0001,004,0002,277,376
6Jan 31, 2023 11:2313,622134,790,299111,058,0002,001,0002,277,376
7Jan 31, 2023 11:2313,705145,827,580112,755,000997,0002,519,040
8Jan 31, 2023 11:2313,709142,437,986111,789,0001,996,0002,269,184
9Jan 31, 2023 11:2313,725136,097,642111,919,0001,998,0002,363,392
10Jan 31, 2023 11:2314,348183,165,116119,091,08602,281,472
11Jan 31, 2023 11:2314,373189,841,569119,293,41402,285,568
12Jan 31, 2023 11:2314,375200,761,123119,310,91402,273,280