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 01:14Huy Duc LeHuy Duc LeScore: 12,762Success
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 01:1412,601130,315,264100,565,0004,022,0002,273,280
2Feb 17, 2024 01:1412,603130,447,975102,590,0002,011,0002,273,280
3Feb 17, 2024 01:1412,607132,298,144103,632,0001,006,0002,273,280
4Feb 17, 2024 01:1412,630131,077,076102,832,0001,996,0002,510,848
5Feb 17, 2024 01:1412,632130,855,241101,851,0002,995,0002,273,280
6Feb 17, 2024 01:1412,758133,657,013104,892,000998,0002,273,280
7Feb 17, 2024 01:1412,762135,535,019102,931,0002,997,0002,273,280
8Feb 17, 2024 01:1412,773131,662,047104,015,0002,000,0002,363,392
9Feb 17, 2024 01:1412,889135,116,918104,978,0001,999,0002,273,280
10Feb 17, 2024 01:1412,956178,613,119107,537,86302,297,856
11Feb 17, 2024 01:1413,034169,736,987108,180,82702,289,664
12Feb 17, 2024 01:1413,046170,570,938108,280,98302,293,760