Vyxal

« first day (708 days earlier) ← previous day next day → last day (1067 days later) »

emanresu A

05:05

For practical programming purposes, it'd be cool to have an "apply to variable" modifier

Also, cursed idea: HTML with embedded Vyxal

Might be a bit tricky to parse

Because stuff like

<% for i in range(5){ %>
<li> <%=i ** 2 %> </li>
<% } %>

lyxal

You've created a horrible mix of python and JSP and I don't know how to feel about that

3 hours later…

user

08:44

I do

Emanresu, I’m sorry but it’s time for you to leave

PyGamer0

09:02

wow its only me and the vyxal bot in this room rn

!!/status

Vyxal Bot

@PyGamer0 I am doing spectacularly.

5 hours later…

Bgil Midol

13:39

!!/status

Vyxal Bot

@BgilMidol I am doing you.

1 hour later…

Seggan

14:51

wooo Jyxal more than 2x faster than C

PyGamer0

wha-

@Seggan what is the program?

5 hours later…

emanresu A

20:10

One of us?

@Seggan Hm, Jyxal must have way better stdout handling because Vyxal's primality testing is sympy bindings written in C

→ 14 messages moved to Trash

1 hour later…

Seggan

21:43

@user both

@emanresuA I dont think its stdout, i think its the fact that push-pops are optimized away and because the jvm constantly optimizes hot code

A: High throughput prime numbers

Jyxal 0.4.1, 46 MiB on my computer {500(&›¥æß¥)W⁋₴ Read the README to see how to run this For reference, the example program outputted 21.8 MiB on my computer. I had a blast micro-optimizing the compiler. The old Jyxal answer was disqualified because it considered multiples of 5 prime. The new v...

emanresu A

Okay :P

If you implemented sympy's primality test it'd be even faster probably

Seggan

i tried

didnt work out for some reason

stopped printing primes after like 28000

emanresu A

Miller-rabin tests are fairly simple to implement

Seggan

but not 100% accurate

the challenge asks for 100% accuracy

emanresu A

Sympy uses a set that's known to have no false positives for n ≤ 2^32

Seggan

21:49

but the challenge requires accuracy for 64 bit nums too

up to 10,000,000,000,000,000

emanresu A

Oh :P

Seggan

so technically, vyxal is possibly disqualified

emanresu A

No counterexamples to sympy's primality test have been found

Seggan

ima need to actually test that lol

if it returns true for all numbers under 2^64, then ill take another shot at implementing it

problem is my computer aint fast enough

emanresu A

22:16

Nvm, sympy's works for n>2^64

« first day (708 days earlier) ← previous day next day → last day (1067 days later) »

Transcript for