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 listOct 9, 2026 04:22highload-churnerhighload-churnerScore: 2,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 04:242,456150,695,688118,207,00021,793,000249,892,864
2Oct 9, 2026 04:242,462151,015,491118,617,00021,741,000249,896,960
3Oct 9, 2026 04:242,475159,126,829118,905,00022,177,000249,892,864
4Oct 9, 2026 04:242,480151,958,377119,617,00021,752,000249,880,576
5Oct 9, 2026 04:242,481152,082,857119,328,00022,129,000249,880,576
6Oct 9, 2026 04:242,483152,085,762119,426,00022,121,000249,876,480
7Oct 9, 2026 04:242,484161,074,359119,614,00021,998,000249,847,808
8Oct 9, 2026 04:242,503153,246,037120,918,00021,761,000249,905,152
9Oct 9, 2026 04:242,505174,467,935120,155,00022,652,000249,909,248