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:38Huy Duc LeHuy Duc LeScore: 12,630Success
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:3812,553164,860,769104,190,16502,289,664
2Feb 17, 2024 14:3812,576131,729,453101,373,0003,011,0002,273,280
3Feb 17, 2024 14:3812,585133,715,758102,447,0002,008,0002,273,280
4Feb 17, 2024 14:3812,598130,164,013102,555,0002,010,0002,273,280
5Feb 17, 2024 14:3812,625132,725,829103,793,000998,0002,514,944
6Feb 17, 2024 14:3812,627132,051,874101,806,0002,994,0002,514,944
7Feb 17, 2024 14:3812,630131,826,601102,836,0001,996,0002,273,280
8Feb 17, 2024 14:3812,687164,855,621105,299,62402,281,472
9Feb 17, 2024 14:3812,773130,365,454105,015,0001,000,0002,273,280
10Feb 17, 2024 14:3812,789135,247,788103,144,0003,004,0002,273,280
11Feb 17, 2024 14:3812,796134,497,573102,196,0004,007,0002,273,280
12Feb 17, 2024 14:3813,011178,274,925107,995,37202,297,856