{"id":15976902,"url":"https://github.com/fornever/numbers","last_synced_at":"2025-06-25T23:06:43.426Z","repository":{"id":140632253,"uuid":"60896941","full_name":"ForNeVeR/Numbers","owner":"ForNeVeR","description":"CPU-based combination solver","archived":false,"fork":false,"pushed_at":"2016-06-14T16:29:38.000Z","size":11,"stargazers_count":3,"open_issues_count":0,"forks_count":1,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-02-05T20:43:34.758Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"F#","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ForNeVeR.png","metadata":{"files":{"readme":"Readme.md","changelog":null,"contributing":null,"funding":null,"license":"License.md","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2016-06-11T07:54:35.000Z","updated_at":"2017-04-06T12:13:08.000Z","dependencies_parsed_at":null,"dependency_job_id":"ed20f836-208d-44ee-abce-a440b3b565d4","html_url":"https://github.com/ForNeVeR/Numbers","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ForNeVeR/Numbers","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ForNeVeR%2FNumbers","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ForNeVeR%2FNumbers/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ForNeVeR%2FNumbers/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ForNeVeR%2FNumbers/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ForNeVeR","download_url":"https://codeload.github.com/ForNeVeR/Numbers/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ForNeVeR%2FNumbers/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":261967132,"owners_count":23237663,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-10-07T22:41:32.655Z","updated_at":"2025-06-25T23:06:43.411Z","avatar_url":"https://github.com/ForNeVeR.png","language":"F#","funding_links":[],"categories":[],"sub_categories":[],"readme":"Numbers\n=======\n\nThis project solves the following seemingly simple task:\n\n\u003e Find all combinations of 1, 2, 3, 4, 5, 6, 7, 8, 9 which evaluates into 100.\n\n\u003e You can insert operators +, *, - and _concat_ between numbers.\n\n\u003e Order of numbers is not important, but each number shold appear once and only\n\u003e once.\n\n\u003e 1 _concat_ 2 = 12.\n\nResource usage\n--------------\n\nOn my hardware (4-core Intel Core i7 870@2.93 GHz with HyperThreading enabled)\nthe program executes for about 4.5 hours. It uses only small amount of RAM\n(about 15 MiB).\n\nSee also\n--------\n\n[Hundreds][hundreds] is a competing software.\n\n[hundreds]: https://github.com/Atomosk/Hundreds\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffornever%2Fnumbers","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffornever%2Fnumbers","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffornever%2Fnumbers/lists"}