go map 300多萬長度的如何快速操作?

//如輸入[1 2 3]，則返回[123 132 213 231 312 321]
func outOrder(trainsNums []string) []string {
    COUNT := len(trainsNums)
    //檢查
    if COUNT == 0 || COUNT > 10 {
        panic("Illegal argument. trainsNums size must between 1 and 9.")
    }
    //如果只有一個(gè)數(shù)，則直接返回
    if COUNT == 1 {
        return []string{trainsNums[0]}
    }
    //否則，將最后一個(gè)數(shù)插入到前面的排列數(shù)中的所有位置（遞歸）
    return insert(outOrder(trainsNums[:COUNT-1]), trainsNums[COUNT-1])
}
func insert(res []string, insertNum string) []string {
    //保存結(jié)果的slice
    result := make([]string, len(res)*(len(res[0])+1))
    index := 0
    for _, v := range res {
        for i := 0; i < len(v); i++ {
            //在v的每一個(gè)元素前面插入
            result[index] = v[:i] + insertNum + v[i:]
            index++
        }
        //在v最后面插入
        result[index] = v + insertNum
        index++
    }
    return result
}

func main(){
    init := []string{
        "1",
        "2",
        "3",
        "4",
        "5",
        "6",
        "7",
        "8",
        "9",
        "0",
    }
    arr := outOrder(init)
    list = make(map[string]int)
    for _,v := range arr {
        list[v] = 0
    }
}

以上代碼生成出來的數(shù)組長度在380萬.假設(shè)我要找key的中第4位包含4的所有字符串,要這么找呢.
key是一串10位數(shù)字不重復(fù)的字符串

目前使用數(shù)據(jù)庫中memory引擎,還是不能達(dá)到我的要求

CREATE TABLE `mem` (
  `k1` tinyint(2) NOT NULL,
  `k2` tinyint(2) NOT NULL,
  `k3` tinyint(2) NOT NULL,
  `k4` tinyint(2) NOT NULL,
  `k5` tinyint(2) NOT NULL,
  `k6` tinyint(2) NOT NULL,
  `k7` tinyint(2) NOT NULL,
  `k8` tinyint(2) NOT NULL,
  `k9` tinyint(2) NOT NULL,
  `k10` tinyint(2) NOT NULL,
  `t1` tinyint(1) DEFAULT NULL,
  `t2` tinyint(1) DEFAULT NULL,
  `t3` tinyint(1) DEFAULT NULL,
  `t4` tinyint(1) DEFAULT NULL,
  `t5` tinyint(1) DEFAULT NULL,
  `he` tinyint(2) DEFAULT NULL,
  `bonus` float DEFAULT NULL,
  PRIMARY KEY (`k1`,`k2`,`k3`,`k4`,`k5`,`k6`,`k7`,`k8`,`k9`,`k10`),
  KEY `k1` (`k1`) USING HASH,
  KEY `k2` (`k2`) USING HASH,
  KEY `k3` (`k3`) USING HASH,
  KEY `k4` (`k4`) USING HASH,
  KEY `k5` (`k5`) USING HASH,
  KEY `k6` (`k6`) USING HASH,
  KEY `k7` (`k7`) USING HASH,
  KEY `k8` (`k8`) USING HASH,
  KEY `k9` (`k9`) USING HASH,
  KEY `k10` (`k10`) USING HASH,
  KEY `t1` (`t1`) USING HASH,
  KEY `t2` (`t2`) USING HASH,
  KEY `t3` (`t3`) USING HASH,
  KEY `t4` (`t4`) USING HASH,
  KEY `t5` (`t5`) USING HASH,
  KEY `he` (`he`) USING BTREE
) ENGINE=MEMORY DEFAULT CHARSET=utf8;

需求:
分別更新k2字段0-9 10個(gè)數(shù)字的bonus字段的數(shù)字,分別+1,+2,+10,這樣就需要10個(gè)update 每個(gè)更新需要0.5秒,更新多個(gè)字段的時(shí)候時(shí)間太久了.