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:24unsatcoreunsatcoreScore: 11,868Success
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:2411,437167,971,69494,928,31602,285,568
2Jan 31, 2023 11:2411,454170,192,89395,068,41902,265,088
3Jan 31, 2023 11:2411,611158,877,29396,367,96802,277,376
4Jan 31, 2023 11:2411,860120,097,61497,433,0001,004,0002,277,376
5Jan 31, 2023 11:2411,862126,053,67497,454,0001,004,0002,277,376
6Jan 31, 2023 11:2411,867120,483,63197,492,0001,005,0002,531,328
7Jan 31, 2023 11:2411,868120,572,72097,496,0001,005,0002,277,376
8Jan 31, 2023 11:2411,870125,504,99698,520,00002,260,992
9Jan 31, 2023 11:2411,883125,707,64796,641,0001,992,0002,260,992
10Jan 31, 2023 11:2411,895130,996,44897,733,000997,0002,277,376
11Jan 31, 2023 11:2411,900123,871,85797,775,000997,0002,277,376
12Jan 31, 2023 11:2411,904129,543,81997,808,000998,0002,277,376