# Python big integer vs. Julia big integer arithmetic

**URL:** <https://discourse.julialang.org/t/python-big-integer-vs-julia-big-integer-arithmetic/115777>\
**Category:** Performance\
**Tags:** python\
**Created:** [June 17, 2024, 9:39pm UTC](https://discourse.julialang.org/t/python-big-integer-vs-julia-big-integer-arithmetic/115777 "2024-06-17T21:39:43Z")\
**Posts on this page:** 1\
**Showing post:** 20

<div class="post-metadata">

**Author:** ![rfateman](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/rfateman/32/22507_2.png) [@rfateman](https://discourse.julialang.org/u/rfateman)\
**Post date:** [June 19, 2024, 3:34am UTC](https://discourse.julialang.org/t/python-big-integer-vs-julia-big-integer-arithmetic/115777/20 "2024-06-19T03:34:05Z")

</div>

In Maxima, one could do this:

```julia
showtime:all$
modulus:101$
rat(3)^10000000; /* rational arithmetic package uses modular arith */
Evaluation took 0.000 seconds... returns result 1.
to get a timing, run it in a loop...
for i:1 thru 1000 do rat(3)^10000000 ;
Evaluation took 0.0000 seconds (0.0040 elapsed) using 698.297 KB.
 now subtract off the empty loop..
(%i6)	for i:1 thru 1000 do nil;
Evaluation took 0.0000 seconds (0.0020 elapsed) using 380.984 KB.
(%o6)	done
  So it is appears to be about 0.0020 milliseconds using 317 bytes.
 (Times on 2.6GHz Intel I5)

```

Maxima is written mostly in Common Lisp and is primarily aimed at  
symbolic math, but also supports some numerical stuff.

---

_[View the full topic](https://discourse.julialang.org/t/python-big-integer-vs-julia-big-integer-arithmetic/115777)._
