Timeline for Summation of large inputs
Current License: CC BY-SA 4.0
17 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jan 19, 2021 at 21:00 | history | tweeted | twitter.com/StackCodeReview/status/1351635563867205632 | ||
Jan 19, 2021 at 17:14 | answer | added | superb rain | timeline score: 0 | |
Jan 19, 2021 at 14:22 | vote | accept | Mohammad Ali Nematollahi | ||
Jan 19, 2021 at 13:36 | answer | added | Kelly Bundy | timeline score: 3 | |
S Jan 19, 2021 at 8:30 | history | suggested | CiaPan | CC BY-SA 4.0 |
minor fix to maths formatting
|
Jan 18, 2021 at 22:00 | review | Suggested edits | |||
S Jan 19, 2021 at 8:30 | |||||
Jan 18, 2021 at 18:34 | comment | added | Kelly Bundy | Please include the link to the challenge. How large can n be? | |
Jan 18, 2021 at 18:07 | vote | accept | Mohammad Ali Nematollahi | ||
Jan 18, 2021 at 18:54 | |||||
Jan 18, 2021 at 17:46 | history | edited | AJNeufeld |
edited tags
|
|
Jan 18, 2021 at 17:46 | answer | added | AJNeufeld | timeline score: 1 | |
Jan 18, 2021 at 16:18 | comment | added | Mohammad Ali Nematollahi | @TedBrownlow I want to count how many same elements exist. For example if you have 4 1's and 10 2's, the summation will be \$ 4 \times 10 \times 2 \$ which is much faster than summing one by one all the floors. | |
Jan 18, 2021 at 16:13 | comment | added | Ted Brownlow |
I don't understand what you're using Counter for here. numbers=[int(number) for number in input.split()] should be sufficient unless I'm missing something
|
|
Jan 18, 2021 at 16:09 | comment | added | Mohammad Ali Nematollahi | @TedBrownlow I didn't understand your question...what do you mean? | |
Jan 18, 2021 at 15:55 | comment | added | Ted Brownlow | What's with the sorted Counter? | |
Jan 18, 2021 at 15:47 | history | edited | Mohammad Ali Nematollahi | CC BY-SA 4.0 |
deleted 67 characters in body
|
Jan 18, 2021 at 13:59 | history | edited | Mohammad Ali Nematollahi | CC BY-SA 4.0 |
deleted 62 characters in body
|
Jan 18, 2021 at 13:53 | history | asked | Mohammad Ali Nematollahi | CC BY-SA 4.0 |