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 listFeb 16, 2024 09:35Huy Duc LeHuy Duc LeScore: 12,588Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2024 09:3512,546174,903,858104,135,41702,285,568
2Feb 16, 2024 09:3512,551159,011,623104,173,41602,289,664
3Feb 16, 2024 09:3512,557162,808,476104,219,15302,293,760
4Feb 16, 2024 09:3512,574127,628,135103,359,0001,003,0002,285,568
5Feb 16, 2024 09:3512,578128,784,227103,396,0001,003,0002,269,184
6Feb 16, 2024 09:3512,586127,348,301103,461,0001,004,0002,273,280
7Feb 16, 2024 09:3512,588126,613,240104,482,00002,265,088
8Feb 16, 2024 09:3512,589126,980,096103,486,0001,004,0002,269,184
9Feb 16, 2024 09:3512,590128,599,079102,491,0002,009,0002,273,280
10Feb 16, 2024 09:3512,593133,442,182103,516,0001,005,0002,285,568
11Feb 16, 2024 09:3512,593127,019,678103,517,0001,005,0002,273,280
12Feb 16, 2024 09:3512,769131,160,473104,980,000999,0002,285,568