{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"omni-math","formal_name":"Omni-MATH","introduction":"Omni-MATH evaluates mathematical reasoning on Olympiad-level problems. Its official dataset contains 4,428 problems accompanied by domain and difficulty information.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"36ea3606-3392-5d0d-ad95-53e7e5ba1400","task_key":"test--36ea3606-3392-5d0d-ad95-53e7e5ba1400","task_revision_id":"1","upstream_id":"","short_description":"A sequence consists of the digits $122333444455555 \\ldots$ such that each…","config":"","split":"test","body":"{\"problem\":\"A sequence consists of the digits $122333444455555 \\\\ldots$ such that each positive integer $n$ is repeated $n$ times, in increasing order. Find the sum of the 4501st and 4052nd digits of this sequence.\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}