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 17, 2024 14:39Huy Duc LeHuy Duc LeScore: 13,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2024 14:3913,718144,729,903112,863,000998,0002,265,088
2Feb 17, 2024 14:3913,724147,565,225111,910,0001,998,0002,285,568
3Feb 17, 2024 14:3913,727141,671,129111,938,0001,998,0002,265,088
4Feb 17, 2024 14:3913,733140,291,992111,987,0001,999,0002,285,568
5Feb 17, 2024 14:3913,733138,277,560112,988,000999,0002,527,232
6Feb 17, 2024 14:3913,734139,412,940111,992,0001,999,0002,265,088
7Feb 17, 2024 14:3913,737142,381,018112,020,0002,000,0002,285,568
8Feb 17, 2024 14:3913,799141,433,567113,530,0001,004,0002,277,376
9Feb 17, 2024 14:3913,834142,563,583113,827,000998,0002,285,568
10Feb 17, 2024 14:3915,881188,452,297131,809,36302,293,760
11Feb 17, 2024 14:3915,893198,138,770131,910,07302,297,856
12Feb 17, 2024 14:3917,119205,690,590142,088,34602,289,664