{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"humaneval-plus","formal_name":"HumanEval+","introduction":"HumanEval+ keeps the 164 original HumanEval problems and multiplies their tests by roughly 80×. It exists because the original suite was loose enough to pass implementations that were actually wrong.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/evalplus/evalplus","indexing_mode":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"4a1a52e4-8efa-59fa-b7b8-b5359110f493","task_key":"default--test--4a1a52e4-8efa-59fa-b7b8-b5359110f493","task_revision_id":"2","upstream_id":"","short_description":"def skjkasdkd(lst):","config":"default","split":"test","body":"{\"entry_point\":\"skjkasdkd\",\"prompt\":\"\\n\\ndef skjkasdkd(lst):\\n    \\\"\\\"\\\"You are given a list of integers.\\n    You need to find the largest prime value and return the sum of its digits.\\n\\n    Examples:\\n    For lst = [0,3,2,1,3,5,7,4,5,5,5,2,181,32,4,32,3,2,32,324,4,3] the output should be 10\\n    For lst = [1,0,1,8,2,4597,2,1,3,40,1,2,1,2,4,2,5,1] the output should be 25\\n    For lst = [1,3,1,32,5107,34,83278,109,163,23,2323,32,30,1,9,3] the output should be 13\\n    For lst = [0,724,32,71,99,32,6,0,5,91,83,0,5,6] the output should be 11\\n    For lst = [0,81,12,3,1,21] the output should be 3\\n    For lst = [0,8,1,2,1,7] the output should be 7\\n    \\\"\\\"\\\"\\n\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/evalplus/evalplus","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}