Trivia Quiz

A rotating on-chain trivia quiz. Call Answer(choiceIdx) with 0-3 to answer the current question — first correct answer scores the point and a new question goes live.

Round 1

What is the time complexity of binary search?

• A (0): O(n)

• B (1): O(log n)

• C (2): O(n^2)

• D (3): O(1)

• Attempts so far this round: 0

Leaderboard

No one has scored yet — be the first!

Total questions answered correctly across all rounds: 0

How to play

gnokey maketx call -pkgpath gno.land/r/g12cs4cehujpffpjpywmkqj43m6u5ya53nj69sjz/trivia \
  -func Answer -args <0|1|2|3> ...