ID NAME QUALITY USERS ACC % DIFFICULTY C I
18164 Atoms in the Lab   28 3333
7
5
328 Bishops   76 7843
14
6
2009 Cryptography   1 91
1
34
314 Digits of e   3 2864
1
1
24 Small factorials   144 35556
15
9
6236 Matches   7 427
27
8
36563 Hard Fibonacci   7 49
20
20
2906 GCD2   51 5823
12
10
2901 One Geometry Problem   9 1584
4
13
10676 0110SS   24 1639
13
9
54 Julka   148 17578
19
6
5699 The last digit re-visited   37 7003
9
9
3932 Point Connection Game in a Circle   2 687
12
17
3970 Convert to Decimal Base System   50
17
17
16034 Minimum Number   4 478
11
1
3023 Binary multiplication   3 224
17
17
35954 New Data Type   -1 105
5
5
18905 Kapti and Balu   1 34
17
17
8676 Digits of Phi (Golden Ratio)   1 286
17
17
270 Digits of Pi   10 5630
9
16
5294 Recurrence   2 249
28
17
29748 Robin Hood   26
1
1
3362 Setnja   2 230
9
17
10334 SOLDIERS   5 635
11
4
1423 Digits of SQRT(2)   5 2650
13
13
738 Another Counting Problem   218
71 Tree   2 402
12
9
1002 Uncle Jack   10 2842
9
8
235 Very Fast Multiplication   21 948
26
22
6479 The Very Greatest Common Divisor   3 85
23
12
1475 Play with Digit Seven   4 84
30
13

#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