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 listOct 7, 2024 21:06Lickety SplitLickety SplitScore: 71,274Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2024 21:0671,239614,863,034589,285,0002,000,0002,387,968
2Oct 7, 2024 21:0671,245621,836,529590,334,0001,000,0002,387,968
3Oct 7, 2024 21:0671,249620,719,647589,365,0002,001,0002,379,776
4Oct 7, 2024 21:0671,259626,062,234591,452,00002,359,296
5Oct 7, 2024 21:0671,274622,507,255589,579,0001,998,0002,347,008
6Oct 7, 2024 21:0671,274620,846,664589,575,0001,998,0002,359,296
7Oct 7, 2024 21:0671,275618,040,545588,586,0002,997,0002,387,968
8Oct 7, 2024 21:0671,280619,611,991590,624,000999,0002,363,392
9Oct 7, 2024 21:0671,287622,457,111589,687,0001,998,0002,379,776