bitwise or

.github/workflows/ci.yml

@@ -2,7 +2,7 @@ name: Do the thing in CI
 
 on:
   push:
-    branches: ['master']
+    branches: ["master"]
 
   # Allows you to run this workflow manually from the Actions tab
   workflow_dispatch:
@@ -11,29 +11,30 @@ jobs:
   run:
     runs-on: ubuntu-latest
     strategy:
+      fail-fast: false
       matrix:
         build:
-        - assembly
-        - bun
-        - clang
-        - cobol
-        - crystal
-        - deno
-        - erlang
-        - fortran
-        - gcc
-        - go
-        - haskell
-        - java
-        - kotlin
-        - node
-        - perl
-        - php
-        - python3
-        - ruby
-        - rust
-        - scala
-        - zig
+          - assembly
+          - bun
+          - clang
+          - cobol
+          - crystal
+          - deno
+          - erlang
+          - fortran
+          - gcc
+          - go
+          - haskell
+          - java
+          - kotlin
+          - node
+          - perl
+          - php
+          - python3
+          - ruby
+          - rust
+          - scala
+          - zig
     steps:
       - name: Checkout
         uses: actions/checkout@v3
@@ -84,7 +85,7 @@ jobs:
           path: "${{ matrix.build }}.json"
 
   report:
-    needs: ['run']
+    needs: ["run"]
     runs-on: ubuntu-latest
     steps:
       - name: Checkout
@@ -102,4 +103,4 @@ jobs:
           cat summary.txt
       - uses: actions/upload-artifact@v3
         with:
-          path: scripts/summary.txt
+          path: scripts/summary.txt

count.asm

@@ -23,15 +23,11 @@ parse_arg:
     cmp byte [rdi + rcx], 0
     jne parse_arg
 
-    mov ecx, eax
-    xor eax, eax
-    mov ebx, 2000000000
+    xor ecx, ecx
 count:
-    mov eax, edx
-    inc eax
-    xor edx, edx
-    div ebx
-    cmp edx, ecx
+    inc ecx
+    or ecx, 1
+    cmp ecx, eax
     jl count
 
     ; print

count.c

@@ -5,7 +5,7 @@ int main(int argc, char *argv[]) {
   int i = 0;
   int target = atoi(argv[1]);
   while(i < target) {
-    i = (i + 1) % 2000000000;
+    i = (i + 1) | 1;
   }
   printf("%d\n", i);
   return 0;

count.cbl

@@ -12,8 +12,7 @@ PROCEDURE DIVISION.
 ACCEPT target FROM COMMAND-LINE
 PERFORM UNTIL i = target
     ADD 1 TO i
-    DIVIDE i BY 2000000000 GIVING quotient REMAINDER rem
-    MOVE rem TO i
+    COMPUTE i = FUNCTION BINARY-OR(i, 1)
 END-PERFORM.
 DISPLAY i
 STOP RUN.

count.cr

@@ -1,7 +1,7 @@
 i = 0
 target = ARGV[0].to_i.not_nil!
 while i < target
-  i = (i + 1) % 2000000000
+  i = (i + 1) | 1
 end
 
 puts i

count.deno

@@ -1,4 +1,4 @@
 let i = 0;
 let target = parseInt(Deno.args[0]);
-while (i < target) i = (i + 1) % 2000000000;
+while (i < target) i = (i + 1) | 1;
 console.log(i);

count.erl

@@ -6,7 +6,7 @@ start(Input) ->
     count(0, Target).
 
 count(N, T) when N < T ->
-    count((N+1) rem 2000000000, T);
+    count((N+1) bor 1, T);
 count(N, _) ->
     io:fwrite("~B~n", [N]),
     init:stop(0).

count.f90

@@ -7,7 +7,7 @@ program count
 
   i = 0
   do while (i < target)
-    i = mod(i + 1, 2000000000);
+    i = ior(i + 1, 1);
   end do
 
   print *, i

count.go

@@ -10,7 +10,7 @@ func main() {
 	i := 0
 	target, _ := strconv.Atoi(os.Args[1])
 	for i < target {
-		i = (i + 1) % 2000000000
+		i = (i + 1) | 1
 	}
 	fmt.Println(i)
 }

count.hs

@@ -3,7 +3,7 @@ import System.Environment
 count :: Int -> Int -> IO ()
 count target n
     | n == target = print n
-    | otherwise   = count target ((n + 1) `mod` 2000000000)
+    | otherwise   = count target ((n + 1) .|. 1)
 
 main :: IO ()
 main = do

count.java

@@ -3,7 +3,7 @@ public static void main(String[] args){
     int i = 0;
     int target = Integer.parseInt(args[0]);
     while (i < target) {
-        i = (i + 1) % 2000000000;
+        i = (i + 1) | 1;
     }
 
     System.out.println(i);

count.js

@@ -1,4 +1,4 @@
 let i = 0;
 let target = parseInt(process.argv[2]);
-while (i < target) i = (i + 1) % 2000000000;
+while (i < target) i = (i + 1) | 1;
 console.log(i);

count.kt

@@ -2,7 +2,7 @@ fun main(args: Array<String>) {
   var i = 0
   val target = args[0].toInt()
   while (i < target) {
-    i = (i + 1) % 2000000000
+    i = (i + 1) or 1
   }
 
   println(i)

count.php

@@ -2,7 +2,7 @@
 $i = 0;
 $target = (int) $argv[1];
 while ($i < $target) {
-  $i = ($i + 1) % 2000000000;
+  $i = ($i + 1) | 1;
 }
 echo $i . "\n";
 ?>

count.pl

@@ -1,4 +1,4 @@
 my $i = 0;
 my $limit = $ARGV[0] + 0;
-for ($i = 0; $i < $limit; $i = ($i + 1) % 2000000000) {}
+for ($i = 0; $i < $limit; $i = ($i + 1) | 1) {}
 print "$i\n";

count.py

@@ -3,6 +3,6 @@
 i = 0
 target = int(sys.argv[1])
 while i < target:
-  i = (i + 1) % 2000000000
+  i = (i + 1) | 1
 
 print(i)

count.rb

@@ -1,7 +1,7 @@
 i = 0
 target = ARGV[0].to_i
 while i < target do
-  i = (i + 1) % 2000000000
+  i = (i + 1) | 1
 end
 
 puts i

count.rs

@@ -4,7 +4,7 @@ fn main() {
     let mut i = 0;
     let target = env::args().nth(1).unwrap().parse::<i32>().unwrap();
     while i < target {
-        i = (i + 1) % 2000000000;
+        i = (i + 1) | 1;
     }
 
     println!("{}", i);

count.scala

@@ -3,7 +3,7 @@ object count {
         var num = 0
         val target = args(0).toInt
         while (num < target) {
-          num = (num + 1) % 2000000000
+          num = (num + 1) | 1
         }
 
         println(num)

count.zig

@@ -8,7 +8,7 @@ pub fn main() !void {
     var target = try std.fmt.parseInt(u32, args[1], 10);
     var i: u32 = 0;
 
-    while (i < target) : (i = (i + 1) % 2000000000) {}
+    while (i < target) : (i = (i + 1) | 1) {}
 
     std.debug.print("{}\n", .{i});
 }