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 19:00Tomislav TunkovicTomislav TunkovicScore: 1,815Success
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 19:031,810111,338,77882,416,00020,787,000249,896,960stderr
2Aug 13, 2026 19:031,811111,413,30682,499,00020,747,000249,901,056stderr
3Aug 13, 2026 19:031,814112,356,52082,654,00020,746,000249,896,960stderr
4Aug 13, 2026 19:031,814111,612,61382,518,00020,883,000249,872,384stderr
5Aug 13, 2026 19:031,815111,658,47882,591,00020,867,000249,905,152stderr
6Aug 13, 2026 19:031,815111,690,56282,423,00021,068,000249,909,248stderr
7Aug 13, 2026 19:031,816111,875,24582,460,00021,094,000249,937,920stderr
8Aug 13, 2026 19:031,850113,725,91984,727,00020,767,000249,872,384stderr
9Aug 13, 2026 19:031,856114,074,39084,761,00021,051,000249,884,672stderr