Standard Nim
Public  06/24/17  8xp  Math  53.3% 
Let $C(n, k)$ be the number of integer solutions $(x_1, \ldots, x_k)$ such that $\bigoplus_{i=1}^k x_i = 0$ and $0 \le x_i < n$ for each $i$. Here, $x \oplus y$ means $x$ xor $y$.
Let $F(n)$ be the $n$th fibonacci number: $F(0) = 0, F(1) = 1$, and $F(i) = F(i  1) + F(i  2)$ for $i \ge 2$.
Let $$ S(n) := \sum_{i=1}^{n} \sum_{j=1}^{n} C(F(i), F(j)). $$ You are given $S(6) = 2153296$ and $S(7) = 18998620089329$.
Find $S(92)$ modulo $10^9 + 7$.
[My timing] 0.3 seconds.
New Members
 JMR03 1d:1h
 MrSexysPizza 2d:9h
 N3W70N 2d:12h
 cod3bluezer0 3d:19h
 cduruk 1w:2d
Fresh Problems

Segments 17h:34m
solved by 3 
Plowing the field 2d:15h
solved by 11 
Mertens Equations 1w:2d
solved by 9 
Vampire Numbers 2w:2d
solved by 11 
Convex numbers 2w:5d
solved by 4