ID NAME QUALITY USERS ACC % DIFFICULTY C I
18164 Atoms in the Lab   20 2635
8
5
328 Bishops   61 6805
15
6
2009 Cryptography   75
314 Digits of e   2656
1
1
24 Small factorials   80 28122
14
8
6236 Matches   3 399
34
1
2906 GCD2   30 4891
11
11
2901 One Geometry Problem   7 1456
5
14
10676 0110SS   12 1394
12
6
54 Julka   81 14477
19
6
5699 The last digit re-visited   28 6301
9
9
3932 Point Connection Game in a Circle   1 609
17
26
3970 Convert to Decimal Base System   48
17
17
16034 Minimum Number   3 414
13
1
3023 Binary multiplication   2 215
17
17
18905 Kapti and Balu   1 30
17
17
8676 Digits of Phi (Golden Ratio)   1 277
17
17
270 Digits of Pi   6 5280
11
19
5294 Recurrence   226
34
17
29748 Robin Hood   19
1
1
3362 Setnja   220
10334 SOLDIERS   4 575
6
1
1423 Digits of SQRT(2)   3 2494
12
6
738 Another Counting Problem   214
71 Tree   2 391
12
9
1002 Uncle Jack   9 2670
9
8
235 Very Fast Multiplication   8 622
30
20
6479 The Very Greatest Common Divisor   2 72
26
9
1475 Play with Digit Seven   2 61
17
17

#big-numbers

The problem involves arbitrary precision arithmetic

https://en.wikipedia.org/wiki/Arbitrary-precision_arithmetic https://en.wikipedia.org/wiki/Karatsuba_algorithm - efficient multiplication algorithm https://en.wikipedia.org/wiki/Toom%E2%80%93Cook_multiplication - as above https://en.wikipedia.org/wiki/Sch%C3%B6nhage%E2%80%93Strassen_algorithm - as above https://en.wikipedia.org/wiki/F%C3%BCrer%27s_algorithm - as above