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 listApr 29, 2024 19:08Steve HanSteve HanScore: 16,113Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2024 19:0816,035190,165,683133,093,39602,301,952
2Apr 29, 2024 19:0816,040198,085,347133,133,52102,301,952
3Apr 29, 2024 19:0816,047184,529,056133,193,72602,306,048
4Apr 29, 2024 19:0816,058204,172,671133,284,48102,301,952
5Apr 29, 2024 19:0816,061191,888,350133,307,96202,179,072
6Apr 29, 2024 19:0816,070206,602,561133,384,90002,179,072
7Apr 29, 2024 19:0816,113193,286,189133,739,35202,301,952
8Apr 29, 2024 19:0816,158193,260,570134,114,45702,306,048
9Apr 29, 2024 19:0816,745209,741,221138,981,82002,306,048
10Apr 29, 2024 19:0816,801206,600,440139,448,72302,306,048
11Apr 29, 2024 19:0816,811201,286,394139,532,64802,301,952
12Apr 29, 2024 19:0816,858213,451,515139,919,12402,306,048