{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"humaneval","formal_name":"HumanEval","introduction":"HumanEval asks for a Python function body from a docstring and signature, checked by hidden unit tests. It is the original functional-correctness benchmark for code generation.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://huggingface.co/datasets/openai/openai_humaneval","indexing_mode":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"7cb76b07-d894-5830-abb6-9f949d3a7ece","task_key":"openai~5fhumaneval--test--7cb76b07-d894-5830-abb6-9f949d3a7ece","task_revision_id":"1","upstream_id":"","short_description":"def find_max(words):","config":"openai_humaneval","split":"test","body":"{\"entry_point\":\"find_max\",\"prompt\":\"\\ndef find_max(words):\\n    \\\"\\\"\\\"Write a function that accepts a list of strings.\\n    The list contains different words. Return the word with maximum number\\n    of unique characters. If multiple strings have maximum number of unique\\n    characters, return the one which comes first in lexicographical order.\\n\\n    find_max([\\\"name\\\", \\\"of\\\", \\\"string\\\"]) == \\\"string\\\"\\n    find_max([\\\"name\\\", \\\"enam\\\", \\\"game\\\"]) == \\\"enam\\\"\\n    find_max([\\\"aaaaaaa\\\", \\\"bb\\\" ,\\\"cc\\\"]) == \\\"\\\"aaaaaaa\\\"\\n    \\\"\\\"\\\"\\n\"}","display_format":"text","language":"","answer_status":"unknown","assets":[],"source_url":"https://huggingface.co/datasets/openai/openai_humaneval","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}