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 listAug 13, 2026 18:43Tomislav TunkovicTomislav TunkovicScore: 1,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 18:451,827112,729,56883,494,00020,692,000249,909,248stderr
2Aug 13, 2026 18:451,828113,361,85283,530,00020,681,000249,892,864stderr
3Aug 13, 2026 18:451,828112,757,62083,463,00020,733,000249,905,152stderr
4Aug 13, 2026 18:451,828112,496,21783,556,00020,657,000249,905,152stderr
5Aug 13, 2026 18:451,830112,913,43983,579,00020,771,000249,880,576stderr
6Aug 13, 2026 18:451,831112,870,95083,559,00020,821,000249,892,864stderr
7Aug 13, 2026 18:451,833112,809,49283,544,00020,968,000249,888,768stderr
8Aug 13, 2026 18:451,834113,018,80583,550,00021,005,000249,905,152stderr
9Aug 13, 2026 18:451,834112,866,17783,579,00020,988,000249,896,960stderr