(Climbing) Suicide Counter

count.js

function countSuicide(moves) {
  var totalMoves = 0;
  
  for (var i = moves; i > 0; i--) {
    totalMoves += i * 2;
  }

  return totalMoves;
}

count.py

def count_suicide(moves):
  total_moves = 0;

  while moves > 0:
    total_moves += moves * 2
    moves -= 1

  return total_moves

def count_suicide(moves):
    total_moves = sum(2 * i for i in range(0, moves + 1))
    return total_moves

List comprehension = "More pythonic Python"

def count_suicide(moves):
  return sum(2 * i for i in range(0, moves + 1))

...i for i... sounds like the Piratic way of doing it.

Talk about pirating! (See comment #1 by jczaplew)
We should now run speed tests to see what really is the fastest.

def count_suicide():
    print("Goodbye, cruel world")
    suicide = 1
    from sys import exit as suicide
    suicide()

import time

def count_suicide1(moves):
  total_moves = 0;

  while moves > 0:
    total_moves += moves * 2
    moves -= 1

  return total_moves

def count_suicide2(moves):
  return sum(2 * i for i in range(0, moves + 1))

start_time = time.time()
count_suicide1(13000)
print(time.time() - start_time)

start_time = time.time()
count_suicide2(13000)
print(time.time() - start_time)

With small numbers they are identical, with larger ones yours is slightly faster.