Fizz Buzz Sergey Svistunov

Perform FizzBuzz on a stream of binary integers as fast as possible.

Input: 30 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: For each number n, print one line:

  • FizzBuzz if n is divisible by both 3 and 5
  • Fizz if n is divisible by 3
  • Buzz if n is divisible by 5
  • n as a decimal string otherwise
Back to listOct 19, 2026 01:48e1011e1011Error
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 01:4803,307,671,8833,015,568,000274,921,000267,939,840line 8: expected Buzz got 1412140751
2Oct 19, 2026 01:4802,934,315,1662,589,795,000315,539,000268,103,680line 8: expected 1805319268 got FizzBuzz
3Oct 19, 2026 01:4802,881,082,9132,579,689,000272,887,000267,886,592line 8: expected 1355577476 got Fizz