Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with code-challenge
Search options not deleted
user 91213
A code challenge is a competition for creative ways to solve a programming puzzle with an objective winning criterion not covered by other scoring tags (e.g. code-golf).
2
votes
Optimal strategy for wandering robots
Rust, cost = ~5032 (1M iterations)
const depth: usize = 1200;
const iterations: usize = 1_000_000;
lazy_static! {
static ref EXPECTED_SCORES: [[usize; 10]; depth] = {
let mut expected_sco …
- 13.5k
1
vote
Strategy: The cunning cousin witch
Rust, score= ~6,081.9
Guesses each number 1-9. Aborts if the number found is less than 0.8 * number.
Anyone is free to copy this answer and further optimize the parameters (0.8 abort limit and 1.0 ste …
- 13.5k
10
votes
Splinter metagolf
Python 3, score: 11069 10495
This algorithm is very slow but I'm pretty sure it's close to optimal depending on the parameters MIN_SPLINTER_SIZE and MAX_SPLINTER_SIZE, though it takes quite long even …
- 13.5k
0
votes
><> numbers metagolf
Python, score=28800
import requests
import string
import itertools
real_printables = {ord(i) for i in (
set(string.printable) - set('\n\t\r\x0b\x0c'))}
def get_factors(num, quote):
quote_fr …
- 13.5k
12
votes
3
answers
486
views
><> numbers metagolf
I struggle to easily encode big numbers in ><>. If only there was a program that could find the best way for me?
What is ><>
><>, pronounced "fish", is a esoteric 2dimentional programing language. We …
- 13.5k
2
votes
Make a long type signature
Rust, 99 bytes, score=46,137,336
fn b<T>(a:T)->Result<T,T>{Ok(a)}b(b(b(b(b(b(b(b(b(b(b(b(b(b(b(b(b(b(b(b(b(b(0))))))))))))))))))))))
Attempt This Online!
- 13.5k
5
votes
Repeat your program to print Fibonacci numbers
JavaScript (Node.js), 38 bytes, 0 Header/Footer
Creates a anonymous function
(a=>a?b=>b?f=c=>c?c(f)(a):a()+b():1:1)
Attempt This Online!
Lambda Calculus go brr
- 13.5k
30
votes
44
answers
4k
views
Repeat your program to print Fibonacci numbers
Write a program fragment so that, when repeated N times it prints the Nth Fibonacci number. For example, if your program is print(x) then:
print(x) should print 1
print(x)print(x) should print 1
prin …
- 13.5k