Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
To prevent security through obscurity, the interpreter should be written in a language in the top 100 of this TIOBE index and have a freely available compiler/interpreter.
The interpreter must not interpret a language which was published before this challenge.
Interpreter should fit into your post and not be hosted externally.
Interpreter should be deterministic
Interpreter should be portable and follow the standard of its own language; don't use undefined behavior or bugs
If the solution program is too long to fit into the answer, you must post a program that generates it.
Solution program should consist only of printable ASCII and newlines.
You must execute your solution program in less than 1 hour on your own computer for each of the example inputs above.
The program should work for any integers less than 106, and any number of integers less than 106 (not necessarily in under an hour), provided that the total input length is less than 109.
To become safe, a cop must edit the solution program into the answer after 8 days have passed.
To prevent security through obscurity, the interpreter should be written in a language in the top 100 of this TIOBE index and have a freely available compiler/interpreter.
The interpreter must not interpret a language which was published before this challenge.
Interpreter should fit into your post and not be hosted externally.
Interpreter should be deterministic
Interpreter should be portable and follow the standard of its own language; don't use undefined behavior or bugs
If the solution program is too long to fit into the answer, you must post a program that generates it.
Solution program should consist only of printable ASCII and newlines.
You must execute your solution program in less than 1 hour on your own computer for each of the example inputs above.
The program should work for any integers less than 106, and any number of integers less than 106 (not necessarily in under an hour).
To become safe, a cop must edit the solution program into the answer after 8 days have passed.
To prevent security through obscurity, the interpreter should be written in a language in the top 100 of this TIOBE index and have a freely available compiler/interpreter.
The interpreter must not interpret a language which was published before this challenge.
Interpreter should fit into your post and not be hosted externally.
Interpreter should be deterministic
Interpreter should be portable and follow the standard of its own language; don't use undefined behavior or bugs
If the solution program is too long to fit into the answer, you must post a program that generates it.
Solution program should consist only of printable ASCII and newlines.
You must execute your solution program in less than 1 hour on your own computer for each of the example inputs above.
The program should work for any integers less than 106, and any number of integers less than 106 (not necessarily in under an hour), provided that the total input length is less than 109.
To become safe, a cop must edit the solution program into the answer after 8 days have passed.
Interpreters should take a filename on the command line for the program, and use standard input and output when running it.
Input will be given in unary and consist only of the characters 0 and 1 (48 and 49 in ASCII). A number N is encoded as N1s followed by a 0. There is an additional 0 before end of file. Example: For the sequence (3, 3, 1, 14), the input is 11101110101111111111111100.
Input is guaranteed to have at least 3 numbers. All numbers are positive integers.
Output will be judged by thenthe number of 1s printed before the program halts. Other characters are ignored.
Interpreters should take a filename on the command line for the program, and use standard input and output when running it.
Input will be given in unary and consist only of the characters 0 and 1 (48 and 49 in ASCII). A number N is encoded as N1s followed by a 0. There is an additional 0 before end of file. Example: For the sequence (3, 3, 1, 14), the input is 11101110101111111111111100.
Input is guaranteed to have at least 3 numbers. All numbers are positive integers.
Output will be judged by then number of 1s printed before the program halts. Other characters are ignored.
Interpreters should take a filename on the command line for the program, and use standard input and output when running it.
Input will be given in unary and consist only of the characters 0 and 1 (48 and 49 in ASCII). A number N is encoded as N1s followed by a 0. There is an additional 0 before end of file. Example: For the sequence (3, 3, 1, 14), the input is 11101110101111111111111100.
Input is guaranteed to have at least 3 numbers. All numbers are positive integers.
Output will be judged by the number of 1s printed before the program halts. Other characters are ignored.
