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 listDec 30, 2024 22:51Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2024 22:4600000Error: bufio.Scanner: token too longstderr
2Dec 30, 2024 23:1500000Error: bufio.Scanner: token too longstderr
3Dec 30, 2024 22:514,491280,829,763233,007,00023,000,000250,183,680
4Dec 30, 2024 23:154,493273,898,473234,102,00022,009,000250,232,832
5Dec 30, 2024 23:154,494282,741,938234,166,00022,015,000250,257,408
6Dec 30, 2024 22:514,497283,297,020234,319,00022,030,000250,281,984
7Dec 30, 2024 22:514,499287,299,608230,510,00025,944,000250,191,872
8Dec 30, 2024 23:154,501282,048,182230,588,00025,953,000250,191,872