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 listNov 5, 2024 09:00kauruuskauruusScore: 97,687Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2024 09:0097,671836,109,927809,670,000999,0002,486,272
2Nov 5, 2024 09:0097,673837,094,742808,689,0001,999,0002,469,888
3Nov 5, 2024 09:0097,677843,612,369807,721,0002,998,0002,490,368
4Nov 5, 2024 09:0097,682841,517,983808,758,0001,999,0002,326,528
5Nov 5, 2024 09:0097,687838,053,144806,801,0003,999,0002,326,528
6Nov 5, 2024 09:0097,697843,876,527808,882,0001,999,0002,326,528
7Nov 5, 2024 09:0097,703838,546,515807,939,0002,999,0002,326,528
8Nov 5, 2024 09:0097,715833,688,283808,033,0003,000,0002,486,272
9Nov 5, 2024 09:0097,717833,088,065808,047,0003,000,0002,293,760