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 15, 2024 19:54Elnur RakhmatullinElnur RakhmatullinScore: 51,899Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 19:5451,887458,029,954428,665,0001,998,0002,277,376
2Oct 15, 2024 19:5451,889460,003,926428,678,0001,998,0002,277,376
3Oct 15, 2024 19:5451,895455,779,213427,732,0002,998,0002,277,376
4Oct 15, 2024 19:5451,897455,576,280427,751,0002,998,0002,293,760
5Oct 15, 2024 19:5451,899462,721,505428,760,0001,998,0002,273,280
6Oct 15, 2024 19:5451,903457,398,628426,793,0003,998,0002,269,184
7Oct 15, 2024 19:5451,908457,747,227428,835,0001,999,0002,277,376
8Oct 15, 2024 19:5451,912457,563,760427,871,0002,999,0002,277,376
9Oct 15, 2024 19:5451,913464,931,296426,878,0003,998,0002,277,376