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 15:25unsatcoreunsatcoreScore: 11,828Success
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 15:2511,713119,356,02495,215,0002,004,0002,277,376
2Jan 31, 2023 15:2511,746126,650,01896,488,0001,005,0002,527,232
3Jan 31, 2023 15:2511,753127,292,55296,544,0001,005,0002,277,376
4Jan 31, 2023 15:2511,755125,961,75596,558,0001,005,0002,277,376
5Jan 31, 2023 15:2511,760122,469,82996,609,000995,0002,277,376
6Jan 31, 2023 15:2511,780125,995,44396,780,000997,0002,519,040
7Jan 31, 2023 15:2511,828120,397,90896,169,0002,003,0002,527,232
8Jan 31, 2023 15:2512,068160,319,499100,167,59302,281,472
9Jan 31, 2023 15:2512,082163,754,044100,278,29102,277,376
10Jan 31, 2023 15:2512,089160,563,666100,335,98002,281,472
11Jan 31, 2023 15:2512,101130,266,629100,436,00002,273,280
12Jan 31, 2023 15:2512,114128,444,575100,546,00002,277,376