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:28unsatcoreunsatcoreScore: 12,744Success
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:2811,936173,587,01899,066,73402,285,568
2Jan 31, 2023 15:2811,940168,048,19299,101,70202,281,472
3Jan 31, 2023 15:2811,944168,012,94499,138,10002,285,568
4Jan 31, 2023 15:2812,720135,368,915104,570,0001,005,0002,277,376
5Jan 31, 2023 15:2812,744134,188,464104,776,000997,0002,519,040
6Jan 31, 2023 15:2812,744133,590,782104,780,000997,0002,527,232
7Jan 31, 2023 15:2812,744130,919,737103,778,0001,995,0002,277,376
8Jan 31, 2023 15:2812,748127,965,738103,812,0001,996,0002,265,088
9Jan 31, 2023 15:2812,750127,294,178103,829,0001,996,0002,277,376
10Jan 31, 2023 15:2812,813128,519,847104,342,0002,006,0002,260,992
11Jan 31, 2023 15:2812,826132,645,907104,448,0002,008,0002,277,376
12Jan 31, 2023 15:2812,890129,599,459104,990,0001,999,0002,269,184