ID NAME QUALITY USERS ACC % DIFFICULTY C I
18164 Atoms in the Lab   28 3443
7
5
328 Bishops   79 7973
14
6
2009 Cryptography   1 92
1
34
314 Digits of e   3 2887
1
1
24 Small factorials   146 37582
15
9
6236 Matches   7 430
27
8
36563 Hard Fibonacci   7 47
20
22
2906 GCD2   53 5989
12
11
2901 One Geometry Problem   9 1590
4
13
10676 0110SS   24 1653
13
9
54 Julka   155 18185
19
6
5699 The last digit re-visited   37 7109
9
9
3932 Point Connection Game in a Circle   3 703
13
21
3970 Convert to Decimal Base System   51
17
17
16034 Minimum Number   4 477
11
1
3023 Binary multiplication   3 224
17
17
35954 New Data Type   -1 106
5
5
18905 Kapti and Balu   1 34
17
17
8676 Digits of Phi (Golden Ratio)   1 286
17
17
270 Digits of Pi   12 5674
9
19
5294 Recurrence   2 251
28
17
29748 Robin Hood   27
1
1
3362 Setnja   2 236
9
17
10334 SOLDIERS   5 639
11
4
1423 Digits of SQRT(2)   5 2660
13
13
738 Another Counting Problem   218
71 Tree   2 404
12
9
1002 Uncle Jack   11 2863
9
8
235 Very Fast Multiplication   22 980
26
22
6479 The Very Greatest Common Divisor   3 84
23
12
1475 Play with Digit Seven   4 90
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