ID NAME QUALITY USERS ACC % DIFFICULTY C I
18164 Atoms in the Lab   25 2954
7
4
328 Bishops   65 7281
14
6
2009 Cryptography   76
314 Digits of e   1 2768
1
1
24 Small factorials   100 30960
15
9
6236 Matches   5 414
28
6
2906 GCD2   41 5321
11
10
2901 One Geometry Problem   8 1523
5
13
10676 0110SS   17 1526
12
6
54 Julka   118 15808
19
6
5699 The last digit re-visited   31 6639
9
9
3932 Point Connection Game in a Circle   1 657
12
17
3970 Convert to Decimal Base System   48
17
17
16034 Minimum Number   3 439
13
1
3023 Binary multiplication   2 220
17
17
18905 Kapti and Balu   1 31
17
17
8676 Digits of Phi (Golden Ratio)   1 284
17
17
270 Digits of Pi   7 5444
10
17
5294 Recurrence   1 240
34
17
29748 Robin Hood   24
1
1
3362 Setnja   221
10334 SOLDIERS   5 600
11
4
1423 Digits of SQRT(2)   3 2575
12
6
738 Another Counting Problem   217
71 Tree   2 394
12
9
1002 Uncle Jack   9 2753
9
8
235 Very Fast Multiplication   16 791
28
22
6479 The Very Greatest Common Divisor   2 73
26
9
1475 Play with Digit Seven   3 65
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