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 1, 2023 21:34sliceteamsliceteamScore: 12,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2023 21:3412,803133,315,051105,265,0001,002,0002,523,136
2Oct 1, 2023 21:3412,805133,147,114106,284,00002,396,160
3Oct 1, 2023 21:3412,809128,781,497105,315,0001,003,0002,510,848
4Oct 1, 2023 21:3412,817128,233,786106,377,00002,260,992
5Oct 1, 2023 21:3412,820129,984,820106,402,00002,260,992
6Oct 1, 2023 21:3412,864138,139,749104,780,0001,995,0002,260,992
7Oct 1, 2023 21:3412,873133,005,195104,845,0001,997,0002,387,968
8Oct 1, 2023 21:3412,885133,136,241105,947,000999,0002,396,160
9Oct 1, 2023 21:3412,924131,718,014105,265,0002,005,0002,387,968
10Oct 1, 2023 21:3413,038172,931,752108,216,68802,265,088
11Oct 1, 2023 21:3413,079174,321,851108,559,22102,269,184
12Oct 1, 2023 21:3413,107182,129,138108,787,75202,260,992