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 16, 2026 23:00Tomislav TunkovicTomislav TunkovicScore: 2,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 01:532,391144,430,005115,578,00020,719,000249,876,480
2Aug 17, 2026 01:532,400146,494,221116,395,00020,444,000249,913,344
3Aug 17, 2026 01:532,400145,032,835116,272,00020,561,000249,884,672
4Aug 17, 2026 01:532,401146,349,000116,289,00020,606,000249,868,288
5Aug 17, 2026 01:532,402145,036,319116,421,00020,517,000249,872,384
6Aug 17, 2026 01:532,402145,505,750116,264,00020,685,000249,909,248
7Aug 17, 2026 01:532,407146,774,456116,457,00020,748,000249,896,960
8Aug 17, 2026 01:532,441147,372,106118,662,00020,483,000249,876,480
9Aug 17, 2026 01:532,529152,360,040123,790,00020,413,000249,888,768