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 listMay 17, 2026 04:14M-RochatM-RochatScore: 6,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 04:166,870484,012,531278,508,000113,082,000201,003,008
2May 17, 2026 04:166,877477,201,714278,507,000113,508,000200,986,624
3May 17, 2026 04:166,892469,793,408278,704,000114,181,000200,929,280
4May 17, 2026 04:166,893470,837,595278,649,000114,295,000200,896,512
5May 17, 2026 04:166,906470,118,735279,079,000114,596,000200,966,144
6May 17, 2026 04:166,913472,009,443278,734,000115,312,000200,998,912
7May 17, 2026 04:166,914468,768,229278,485,000115,629,000201,015,296
8May 17, 2026 04:166,921474,318,007278,279,000116,261,000200,851,456
9May 17, 2026 04:166,942472,073,221278,456,000117,270,000200,830,976