#BrainCubed

##The Task

##Input

##Output

##Rules and Scoring

###SANDBOX NOTES

BrainCubed

The Task

Input

Output

Rules and Scoring

SANDBOX NOTES

• You may choose to accept input in any integer base, so long as this base does not vary from input to input. (e.g. binary, hexadecimal, decimal)

• You may assume that x is in the range 0 <= x <= 255

• You should take input as a string of characters, not bytes. For example, if x = 33 and my program accepts input in binary, I should receive the string "100001" (bytes: 49 48 48 48 48 49) not simply bytes containing 100001.

Let N(x) denote the right-most (highest n) cell that the program ever sends the tape pointer to (not necessarily modified) for a given input x. Your score for this challenge is then sum (x = 0, 1, 2, ... 100) N(x)

• Your program must be written entirely in Brainfuck.
• Assume the highest value a cell can hold is 255 before wrapping to 0, and that moving left off of the tape will cause the robot to suddenly and violently crash.
• Your program should not exceed 10k bytes, nor should it take more than 10 minutes to compute x^3 for any x <= 255 on a relatively modern machine.
• Standard loopholes are disallowed.

• You may choose to accept input in any integer base greater than 0 and less than or equal to 36, so long as this base does not vary from input to input. (e.g. binary, hexadecimal, decimal)

• You may assume that x is in the range 0 <= x <= 2^16 - 1

• You should take input as a string of characters, not bytes. For example, if x = 33 and my program accepts input in binary, I should receive the string "100001" (bytes: 49 48 48 48 48 49) not simply bytes containing 100001.

Let N(x) denote the right-most (highest n) cell that the program ever sends the tape pointer to (not necessarily modified) for a given input x. Your score for this challenge is then sum (x = 0, 1, 2, ... 100) N(x) (modification pending)

• Your program must be written entirely in Brainfuck.
• Assume the highest value a cell can hold is 255 before wrapping to 0, and that moving left off of the tape will cause the robot to suddenly and violently crash.
• Your program should not exceed 10k bytes, nor should it take more than 10 minutes to compute x^3 for any x <= 2^16 - 1 on a relatively modern machine.
• Standard loopholes are disallowed.

• x can be in any numerical base -- decimal, binary, hexadecimal, pi, whatever.

• You may assume that x is in the range 0 <= x <= 255

• Your Brainfuck program must output the value of x^3 in the same base that input was received in.

• The program must terminate, and should not print anything except for its numerical output.

Your score in this challenge is defined in the following manner: Let the tape of the Brainfuck memory be described as having a 0th element at the left-most position, and then with potentially infinite cells to the right, indexed by increasing integers n.

• You may choose to accept input in any integer base, so long as this base does not vary from input to input. (e.g. binary, hexadecimal, decimal)

• You may assume that x is in the range 0 <= x <= 255

• You should take input as a string of characters, not bytes. For example, if x = 33 and my program accepts input in binary, I should receive the string "100001" (bytes: 49 48 48 48 48 49) not simply bytes containing 100001.

• Your Brainfuck program must output the value of x^3 in the same base that input was received in.

• As it is for input, your program should output a string of ASCII characters, not a sequence of bytes.

• The program must terminate, and should not print anything except for its numerical output.

Your score in this challenge is defined in the following manner: Let the tape of the Brainfuck memory be described as having a 1st element at the left-most position, and then with potentially infinite cells to the right, indexed by increasing integers n.