Author Topic: SALC Rasbian 32 (Read 18577 times)

John Spikowski · « **on:** November 28, 2019, 05:03:24 AM »

I 'm going to take this challenge one more round and add a string and array to the mix.

FYI: This site is a forum and not my blog. Without contributing members it will soon become dormant. It only takes a minute to register. It's okay to be a member of multiple forums and I'm pretty sure the RPi moderators won't ban you if you appear here.

John Spikowski · « **Reply #1 on:** November 28, 2019, 07:28:13 AM »

ScriptBasic

The array part takes 4 seconds of the total time.,

Code: Script BASIC

' ScriptBasic - 1mil3.sb
 
s = ""
t = ""
SPLITA STRING(1000001,"0") BY "" TO a
 
FOR x = 1 TO 1000000
  s &= CHR(((x - 1) % 26) + 65)
  a[x] = x
  IF LEN(s) = 26 THEN
    t &= s
    s = ""
  END IF
NEXT
r = STRREVERSE(t)
PRINT "r LEN: ",LEN(r),"\n"
PRINT "Front: ",LEFT(r, 26),"\n"
PRINT "Back:  ",RIGHT(r, 26),"\n"
PRINT "UBVal: ",a[1000000],"\n"
 

pi@RPi4B:~/sbrt/examples $ /usr/bin/time scriba 1mil3.sb r LEN: 999986 Front: ZYXWVUTSRQPONMLKJIHGFEDCBA Back: ZYXWVUTSRQPONMLKJIHGFEDCBA UBVal: 1000000 15.64user 34.88system 0:50.55elapsed 99%CPU (0avgtext+0avgdata 172504maxresident)k 536inputs+0outputs (2major+4122825minor)pagefaults 0swaps pi@RPi4B:~/sbrt/examples $

John Spikowski · « **Reply #2 on:** November 28, 2019, 07:11:56 PM »

8th (Jalih submission)

Code: Text

: plus-minus
  n:1+
  swap
  n:1-
  swap
  2dup n:= if
    "Middle\n" .
  then ;
 
: app:main
  1000000 0
  ' plus-minus 1000000 times
  "Plus: %d\nMinus: %d\n" s:strfmt .
  bye ;
 

pi@RPi4B:~/8th-dev/examples $ /usr/bin/time ./mil Middle Plus: 1000000 Minus: 0 0.41user 0.03system 0:00.45elapsed 96%CPU (0avgtext+0avgdata 6944maxresident)k 0inputs+0outputs (0major+340minor)pagefaults 0swaps pi@RPi4B:~/8th-dev/examples $

John Spikowski · « **Reply #3 on:** November 28, 2019, 09:00:08 PM »

BaCon

Code: Text

' BaCon - 1mil3.bac
 
s$ = ""
t$ = ""
DECLARE a[1000001] TYPE NUMBER
 
FOR x = 1 TO 1000000
  s$ = s$ & CHR$(MOD((x - 1), 26) + 65)
  a[x] = x
  IF LEN(s$) = 26 THEN
    t$ = t$ & s$
    s$ = ""
  END IF
NEXT
r$ = REVERSE$(t$)
PRINT "r LEN: ",LEN(r$)
PRINT "Front: ",LEFT$(r$, 26)
PRINT "Back:  ",RIGHT$(r$, 26)
PRINT "UBVal: ",a[1000000]
 

pi@RPi4B:~/bacon-dev/examples $ bacon 1mil3.bac Converting '1mil3.bac'... done, 21 lines were processed in 0.053 seconds. Compiling '1mil3.bac'... cc -c 1mil3.bac.c cc -o 1mil3 1mil3.bac.o -lbacon -L. -lm Done, program '1mil3' ready. pi@RPi4B:~/bacon-dev/examples $ ls -l 1mil3 -rwxr-xr-x 1 pi pi 109628 Nov 29 20:32 1mil3 pi@RPi4B:~/bacon-dev/examples $ /usr/bin/time ./1mil3 r LEN: 999986 Front: ZYXWVUTSRQPONMLKJIHGFEDCBA Back: ZYXWVUTSRQPONMLKJIHGFEDCBA UBVal: 1000000 12.99user 0.00system 0:13.02elapsed 99%CPU (0avgtext+0avgdata 9356maxresident)k 0inputs+0outputs (0major+2157minor)pagefaults 0swaps pi@RPi4B:~/bacon-dev/examples $

John Spikowski · « **Reply #4 on:** November 29, 2019, 12:43:11 AM »

FreeBasic

Code: FreeBasic

' FreeBasic - 1mil3.bas
 
DIM s AS STRING
DIM t AS STRING
DIM r AS STRING
DIM SHARED a(1000001) AS INTEGER
DIM x AS INTEGER
 
FOR x = 1 TO 1000000
  s &= CHR(((x - 1) MOD 26) + 65)
  a(x) += x
  IF LEN(s) = 26 THEN
    t &= s
    s = ""
  ENDIF
NEXT
 
FOR x = LEN(t) TO 1 STEP -1
  r &= MID(t,x,1)
NEXT
 
PRINT "r LEN: " & LEN(r)
PRINT "Front: " & LEFT(r, 26)
PRINT "Back:  " & RIGHT(r, 26)
PRINT "UBVal: " & a(1000000)
 

pi@RPi4B:~/freebasic-dev/examples $ fbc 1mil3.bas pi@RPi4B:~/freebasic-dev/examples $ ls -l 1mil3 -rwxr-xr-x 1 pi pi 30640 Nov 28 16:40 1mil3 pi@RPi4B:~/freebasic-dev/examples $ /usr/bin/time ./1mil3 r LEN: 999986 Front: ZYXWVUTSRQPONMLKJIHGFEDCBA Back: ZYXWVUTSRQPONMLKJIHGFEDCBA UBVal: 1000000 0.53user 0.05system 0:00.60elapsed 96%CPU (0avgtext+0avgdata 7848maxresident)k 0inputs+0outputs (0major+2623minor)pagefaults 0swaps pi@RPi4B:~/freebasic-dev/examples $

John Spikowski · « **Reply #5 on:** November 29, 2019, 02:24:05 AM »

PHP Update

Code: PHP

<?php
 
# PHP -1mil3-2.php
 
$s = "";
$t = "";
$a = array();
 
for ($x = 1; $x <= 1000000; $x++) {
  $s .= chr((($x - 1) % 26) + 65);
  $a[$x] = $x;
  if(strlen($s) == 26) {
    $t .= $s;
    $s = "";
  } 
}
 
$r = strrev($t);
 
echo "r LEN: ", strlen($r), "\n";
echo "Front: ", substr($r, 0, 26), "\n";
echo "Back:  ", substr($r, -26), "\n";
echo "UBVal: ", $a[1000000],"\n";
 
?>
 

pi@RPi4B:~/php-dev/examples $ timex php 1mil3-2.php r LEN: 999986 Front: ZYXWVUTSRQPONMLKJIHGFEDCBA Back: ZYXWVUTSRQPONMLKJIHGFEDCBA UBVal: 1000000 0.43user 0.12system 0:00.57elapsed 98%CPU (0avgtext+0avgdata 38820maxresident)k 0inputs+0outputs (0major+9720minor)pagefaults 0swaps pi@RPi4B:~/php-dev/examples $

John Spikowski · « **Reply #6 on:** November 29, 2019, 11:45:38 PM »

Python 3

Code: Python

# Python 3 - 1mil3.py
 
s = ""
t = ""
a = [None] * 1000001
 
for x in range(1000001):
  s += chr(((x) % 26) + 65)
  a[x] = x
  if len(s) == 26:
    t += s
    s = ""
 
r = "".join(reversed(t))
 
print("r LEN: {}".format(len(r)))
print("Front: {}".format(r[:26]))
print("Back:  {}".format(r[-26:]))
print("UBVal: {}".format(a[1000000]))
 

pi@RPi4B:~/python-dev/examples $ /usr/bin/time python3 1mil3,py r LEN: 999986 Front: ZYXWVUTSRQPONMLKJIHGFEDCBA Back: ZYXWVUTSRQPONMLKJIHGFEDCBA UBVal: 1000000 1.87user 0.09system 0:01.97elapsed 99%CPU (0avgtext+0avgdata 32660maxresident)k 0inputs+0outputs (0major+7192minor)pagefaults 0swaps pi@RPi4B:~/python-dev/examples $

John Spikowski · « **Reply #7 on:** November 30, 2019, 07:42:29 PM »

The Swift round two post has been updated. The compiler now correctly prints middle.

The swift-5.1.2_armv7.tgz file is 206 MB. I will have to upload it to the server and provide a link to download. This build is the current release with the latest updates as of build time.

AIR submitted an improvement to the Python script to not require numpy.

John Spikowski · « **Reply #8 on:** November 30, 2019, 09:26:43 PM »

8th (Jalih submission)

Code: Text

1000000 constant LIMIT
 
a:new 0 a:push var, a
"" var, s
"" var, t
 
: rev  \ s -- s
  b:new b:rev >s ;
 
: iterate
  s @ over n:1- 26 n:mod 65 n:+ s:+ s !
  s @ s:len 26 n:< not if
    t @ swap s:+ t !
    "" s !
  else
    drop
  then
  a:push ;
 
: app:main
  a @ ' iterate 1 LIMIT loop
  t @ rev s:len "r LEN: %d\n" s:strfmt .
  dup 26 s:lsub "Front: %s\n" s:strfmt .
  26 s:rsub "Back:  %s\n" s:strfmt .
  LIMIT a:@ nip "UBVal: %d\n" s:strfmt .
  bye ;
 

pi@RPi4B:~/8th-dev/examples $ /usr/bin/time ./1mil3 r LEN: 999986 Front: ZYXWVUTSRQPONMLKJIHGFEDCBA Back: ZYXWVUTSRQPONMLKJIHGFEDCBA UBVal: 1000000 10.33user 30.38system 0:40.75elapsed 99%CPU (0avgtext+0avgdata 61464maxresident)k 0inputs+0outputs (0major+3677030minor)pagefaults 0swaps pi@RPi4B:~/8th-dev/examples $

John Spikowski · « **Reply #9 on:** December 01, 2019, 07:28:32 PM »

C (AIR submission)

Code: C

// C - 1mil3.c - AIR
 
#define _GNU_SOURCE
 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
 
#define join(write_to,  ...) {           \
    char *tmp_string_for_extend = (write_to); \
    asprintf(&(write_to), __VA_ARGS__);       \
    free(tmp_string_for_extend);              \
}
 
char *strrev(char *str)
{
    if (!str || ! *str)
        return str;
 
    int i = strlen(str) - 1, j = 0;
 
    char ch;
    while (i > j) {
        ch = str[i];
        str[i] = str[j];
        str[j] = ch;
        i--;
        j++;
    }
    return str;
}
 
 
int main() {
    int a[1000001] = {0};
    int i;
    char *s=NULL,*t=NULL;
 
    join(s,"");
    join(t,"");
 
    for (int x = 0; x < 1000001; x++) {
        a[x] = x;
 
        join(s,"%s%c",s,(x%26)+65);
 
        if (strlen(s) == 26) {
            join(t,"%s%s",t,s);
            join(s,"");
        }
    }
 
    free(s);
    strrev(t);
 
    printf("r LEN: %lu\n",strlen(t));
    printf("Front: %.*s\n", 26, t);
    printf("Back: %s\n", t + strlen(t) - 26);
    printf("UBVal: %d\n",a[1000000]);
 
}
 

pi@RPi4B:~/c-dev/examples $ gcc -O3 1mil3.c -o 1mil3 pi@RPi4B:~/c-dev/examples $ ls -l 1mil3 -rwxr-xr-x 1 pi pi 8140 Dec 1 11:23 1mil3 pi@RPi4B:~/c-dev/examples $ /usr/bin/time ./1mil3 r LEN: 999986 Front: ZYXWVUTSRQPONMLKJIHGFEDCBA Back: ZYXWVUTSRQPONMLKJIHGFEDCBA UBVal: 1000000 45.56user 63.56system 1:49.17elapsed 99%CPU (0avgtext+0avgdata 23956maxresident)k 0inputs+0outputs (0major+7535448minor)pagefaults 0swaps pi@RPi4B:~/c-dev/examples $

John Spikowski · « **Reply #10 on:** December 01, 2019, 09:45:22 PM »

Swift 5.1.2

Looking for a faster string reverse.

Code: Text

// Swift 5.1.2 - 1mil3.swift
 
var s = ""
var t = ""
var a = [Int]()
var r = ""
 
for x in 1...1000000 {
  s += String(UnicodeScalar(UInt8(((x - 1) % 26) + 65)))
    a.append(x)
  if s.count == 26 {
//  t += s
    r += s   
    s = ""
  }
}
 
// let r = String(t.reversed())
 
print("r LEN: ", r.count)
print("Front: \(r.prefix(26))")
print("Back:  \(r.suffix(26))")
print("UBVal: ", a[100000 - 1])
 

with string reverse
pi@RPi4B:~/swift-dev/examples $ /usr/bin/time ./main r LEN: 999986 Front: ZYXWVUTSRQPONMLKJIHGFEDCBA Back: ZYXWVUTSRQPONMLKJIHGFEDCBA UBVal: 100000 322.51user 0.07system 5:22.70elapsed 99%CPU (0avgtext+0avgdata 13836maxresident)k 0inputs+0outputs (0major+3470minor)pagefaults 0swaps pi@RPi4B:~/swift-dev/examples $

without string reverse
pi@RPi4B:~/swift-dev/examples $ /usr/bin/time ./main r LEN: 999986 Front: ABCDEFGHIJKLMNOPQRSTUVWXYZ Back: ABCDEFGHIJKLMNOPQRSTUVWXYZ UBVal: 100000 36.12user 0.04system 0:36.17elapsed 99%CPU (0avgtext+0avgdata 12800maxresident)k 0inputs+0outputs (0major+2925minor)pagefaults 0swaps pi@RPi4B:~/swift-dev/examples $

John Spikowski · « **Reply #11 on:** December 02, 2019, 12:50:07 AM »

GO Update (AIR submission)

Code: Go

// GO - 1mil3-2.go - AIR
 
package main
 
import (
    "fmt"
    "strings"
)
 
// Reverse returns its argument string reversed rune-wise left to right.
// From: https://github.com/golang/example/blob/master/stringutil/reverse.go
func Reverse(s string) string {
    r := []rune(s)
    for i, j := 0, len(r)-1; i < len(r)/2; i, j = i+1, j-1 {
        r[i], r[j] = r[j], r[i]
    }
    return string(r)
}
 
func main() {
    var s strings.Builder
    var r = ""
    var t strings.Builder
    var a [1000001]int
 
    for x := 0; x < 1000001; x++ {
        a[x] = x
 
        s.WriteByte(byte((x % 26) + 65))
 
        if s.Len() == 26 {
            t.WriteString(s.String())
            s.Reset()
        }
    }
 
    r = Reverse(t.String())
 
    fmt.Println("r LEN: ", len(r))
    fmt.Println("Front: ", r[0:26])
    fmt.Println("Back:  ", r[len(r)-26:])
    fmt.Println("UBVal: ", a[1000000])
 
}
 

pi@RPi4B:~/go-dev/examples $ go build 1mil3-2.go pi@RPi4B:~/go-dev/examples $ ls -l 1mil3-2 -rwxr-xr-x 1 pi pi 1763559 Dec 4 18:33 1mil3-2 pi@RPi4B:~/go-dev/examples $ /usr/bin/time ./1mil3-2 r LEN: 999986 Front: ZYXWVUTSRQPONMLKJIHGFEDCBA Back: ZYXWVUTSRQPONMLKJIHGFEDCBA UBVal: 1000000 0.10user 0.08system 0:00.16elapsed 112%CPU (0avgtext+0avgdata 16868maxresident)k 0inputs+0outputs (0major+4032minor)pagefaults 0swaps pi@RPi4B:~/go-dev/examples $

John Spikowski · « **Reply #12 on:** December 02, 2019, 05:26:34 AM »

Nim (AIR submission)

Code: Text

proc reverse*(str: string): string =
  result = ""
  for index in countdown(str.high, 0):
    result.add(str[index])
 
type
    milarray = array[1000001, int]
 
var
    s = ""
    t = ""
    r:string
    a:milarray
 
for x in 0..1000000:
    a[x] = x
 
    s &= chr((x mod 26) + 65)
 
    if s.len == 26:
        t &= s
        s = ""
 
 
r = t.reverse
echo "r Len: ",r.len
echo "Front: ",r[0..25]
echo "Back:  ",r[r.len-26..r.len-1]
echo "UBVal: ",a[1000000]
 

pi@RPi4B:~/nim-dev/examples $ nim c -d:release onemil3.nim Hint: used config file '/etc/nim/nim.cfg' [Conf] Hint: system [Processing] Hint: onemil3 [Processing] Hint: [Link] Hint: operation successful (12410 lines compiled; 0.566 sec total; 10.754MiB peakmem; Release Build) [SuccessX] pi@RPi4B:~/nim-dev/examples $ ls -l onemil3 -rwxr-xr-x 1 pi pi 57548 Dec 1 21:21 onemil3 pi@RPi4B:~/nim-dev/examples $ /usr/bin/time ./onemil3 r Len: 999986 Front: ZYXWVUTSRQPONMLKJIHGFEDCBA Back: ZYXWVUTSRQPONMLKJIHGFEDCBA UBVal: 1000000 0.06user 0.05system 0:00.12elapsed 99%CPU (0avgtext+0avgdata 10048maxresident)k 0inputs+0outputs (0major+2294minor)pagefaults 0swaps pi@RPi4B:~/nim-dev/examples $

John Spikowski · « **Reply #13 on:** December 03, 2019, 01:42:35 AM »

JavaScript

Code: Javascript

// JavaScript - 1mil3.js
 
function reverseString(str){
    let strn ="";
    for(let char of str){
        strn = char + strn;
    }
    return strn;
}
 
var s = "";
var t = "";
var a = [1000001];
 
for (x = 1; x <= 1000000; x++) {
  s += String.fromCharCode(((x - 1) % 26) + 65);
  a[x] = x;
  if(s.length == 26) {
        t += s;
        s = "";
  }
}
 
r = reverseString(t);
 
console.log("r LEN: " + r.length);
console.log("Front: " + r.substring(0, 26));
console.log("Back:  " + r.substring(-0, 26));
console.log("UBVal: " + a[1000000]);
 

pi@RPi4B:~/javascript-dev/examples $ /usr/bin/time node 1mil3.js r LEN: 999986 Front: ZYXWVUTSRQPONMLKJIHGFEDCBA Back: ZYXWVUTSRQPONMLKJIHGFEDCBA UBVal: 1000000 2.50user 0.27system 0:03.13elapsed 88%CPU (0avgtext+0avgdata 78340maxresident)k 38664inputs+0outputs (153major+19367minor)pagefaults 0swaps pi@RPi4B:~/javascript-dev/examples $

John Spikowski · « **Reply #14 on:** December 03, 2019, 05:01:29 AM »

JADE (AIR submission)

Code: C++

#include <jade.hpp>
 
MAIN
    STRING s,t,r;
    ARRAY<int> a;
 
    FOR( VAR x = 0 TO x<1000001 STEP x++ ) DO
        a.push_back(x);
        s += (CHAR)(x%26)+65;
 
        IF ( LEN(s) == 26 ) THEN
            t += s;
            s = "";
        END
    END
 
    r = REVERSE$(t);
 
    PRINT("r LEN: ",LEN(t));
    PRINT("Front: ", LEFT$(r,26));
    PRINT("Back:  ", RIGHT$(r,26));
    PRINT("UBVal: ",a[1000000]);
END
 

pi@RPi4B:~/jade-dev/examples $ g++ -O3 -std=c++11 mil.cpp -ljade -o mil pi@RPi4B:~/jade-dev/examples $ /usr/bin/time ./mil r LEN: 999986 Front: ZYXWVUTSRQPONMLKJIHGFEDCBA Back: ZYXWVUTSRQPONMLKJIHGFEDCBA UBVal: 1000000 0.08user 0.04system 0:00.12elapsed 98%CPU (0avgtext+0avgdata 9012maxresident)k 0inputs+0outputs (0major+3762minor)pagefaults 0swaps pi@RPi4B:~/jade-dev/examples $

News:

Author Topic: SALC Rasbian 32 (Read 18577 times)

John Spikowski

SALC Rasbian 32

John Spikowski

Re: SALC Rasbian 32

John Spikowski

Re: SALC Rasbian 32

John Spikowski

Re: SALC Rasbian 32

John Spikowski

Re: SALC Rasbian 32

John Spikowski

Re: SALC Rasbian 32

John Spikowski

Re: SALC Rasbian 32

John Spikowski

Re: SALC Rasbian 32

John Spikowski

Re: SALC Rasbian 32

John Spikowski

Re: SALC Rasbian 32

John Spikowski

Re: SALC Rasbian 32

John Spikowski

Re: SALC Rasbian 32

John Spikowski

Re: SALC Rasbian 32

John Spikowski

Re: SALC Rasbian 32

John Spikowski

Re: SALC Rasbian 32