Search / uk.co.reliness/code-utilities
protogridR0· no sign-inDeterministic string, list and number routines: palindromes, sorting, searching, validation, merging
v1.5.0 · active · website · descriptor JSON · versions
{
"mcpServers": {
"code-utilities": {
"type": "http",
"url": "https://ukdata.reliness.co.uk/mcp/code-utilities",
"headers": {
"Authorization": "Bearer ${CODE_UTILITIES_TOKEN}"
}
}
}
}claude mcp add --transport http code-utilities https://ukdata.reliness.co.uk/mcp/code-utilities --header "Authorization: Bearer ${CODE_UTILITIES_TOKEN}"[mcp_servers.code-utilities]
url = "https://ukdata.reliness.co.uk/mcp/code-utilities"
bearer_token_env_var = "CODE_UTILITIES_TOKEN"
{
"$schema": "https://opencode.ai/config.json",
"mcp": {
"code-utilities": {
"type": "remote",
"url": "https://ukdata.reliness.co.uk/mcp/code-utilities",
"enabled": true,
"headers": {
"Authorization": "Bearer {env:CODE_UTILITIES_TOKEN}"
}
}
}
}{
"mcpServers": {
"code-utilities": {
"type": "http",
"url": "https://ukdata.reliness.co.uk/mcp/code-utilities",
"headers": {
"Authorization": "Bearer ${CODE_UTILITIES_TOKEN}"
}
}
},
"deeplink": "cursor://anysphere.cursor-deeplink/mcp/install?name=code-utilities&config=eyJ0eXBlIjoiaHR0cCIsInVybCI6Imh0dHBzOi8vdWtkYXRhLnJlbGluZXNzLmNvLnVrL21jcC9jb2RlLXV0aWxpdGllcyIsImhlYWRlcnMiOnsiQXV0aG9yaXphdGlvbiI6IkJlYXJlciAke0NPREVfVVRJTElUSUVTX1RPS0VOfSJ9fQ%3D%3D"
}{
"servers": {
"code-utilities": {
"type": "http",
"url": "https://ukdata.reliness.co.uk/mcp/code-utilities",
"headers": {
"Authorization": "Bearer ${CODE_UTILITIES_TOKEN}"
}
}
}
}{
"mcpServers": {
"code-utilities": {
"httpUrl": "https://ukdata.reliness.co.uk/mcp/code-utilities",
"headers": {
"Authorization": "Bearer ${CODE_UTILITIES_TOKEN}"
}
}
}
}extensions:
"code-utilities":
enabled: true
name: "code-utilities"
type: streamable_http
uri: "https://ukdata.reliness.co.uk/mcp/code-utilities"
headers:
"Authorization": "Bearer ${CODE_UTILITIES_TOKEN}"
timeout: 300
Placeholders to fill from your own secret store: ${CODE_UTILITIES_TOKEN}. The registry never accepts secret values.
protocol.modernnewest supported version is 2025-11-25; 2026-07-28 not supported, older versions are deprecated until 2027-07-28protocol.statelessonly applies to 2026-07-28 serversprotocol.transportstreamable HTTPprotocol.list_ttlonly applies to 2026-07-28 serversauth.prm, auth.as_metadata, auth.cimdno remote uses OAuthauth.secret_in_urlno templated URLtools.descriptionsevery tool has a descriptiontools.description_lengthdescriptions are concisetools.schemasevery tool has an object input schematools.annotations32 of 32 tools declare readOnlyHint or destructiveHinttools.directory_hintsevery tool declares readOnlyHint, destructiveHint, idempotentHint and openWorldHinttools.token_costabout 4,223 tokens to load every tooltools.api_dumptools are not a one-to-one API dumpstability.changes, stability.rug_pulltool history recorded for 0 of the 7 days neededdeps.known_vulns, deps.mcp_sdk_version, deps.resolvableno npm or PyPI packageNo tool definition changes recorded. A server's first observation is its baseline; later probes record what changes.
Checks run on what our credential-free, read-only probes observe; tools are never called and no code audit is performed. How it is computed.
+dns-namespace +website +reachable +uptime-100% +updated-0d-ago -no-repository
Derived from observable signals (official registry feed and our own credential-free probes); no code audit performed. How it is computed.
| remote | auth | reachable | uptime 30d | p50 | protocol | last ok |
|---|---|---|---|---|---|---|
https://ukdata.reliness.co.uk/mcp/code-utilities streamable-http | none | yes | 100% | 21 ms | 2025-11-25 | 2026-11-07 |
binary_additionread-only | Adds two binary numbers represented as strings and returns the sum as a binary string. Performs binary arithmetic with carry propagation. (cost: 1 credit) |
binary_searchread-only | Performs binary search on a sorted list to find the index of a target value, returning -1 if not found. (cost: 1 credit) |
can_attend_meetingsread-only | Determines if a person can attend all meetings given a list of time intervals by checking for overlapping time slots. Returns true if no meetings conflict, false otherwise. (cost: 1 credit) |
count_bitsread-only | Counts the number of set bits (1's) in the binary representation of a non-negative integer. (cost: 1 credit) |
find_duplicate_numberread-only | Finds the duplicate number in a list of integers where exactly one number appears more than once. Returns the duplicate value. (cost: 1 credit) |
find_equilibrium_indexread-only | Finds the equilibrium index in an array where the sum of elements to the left equals the sum of elements to the right. Returns -1 if no such index exists. (cost: 1 credit) |
find_first_non_repeating_charread-only | Finds the first character in a string that appears only once. Returns null if all characters repeat. (cost: 1 credit) |
find_kth_smallestread-only | Finds the kth smallest number in an unsorted list (1-indexed, where k=1 returns the smallest element). (cost: 1 credit) |
find_longest_wordread-only | Finds and returns the longest word in a given text string. If multiple words have the same maximum length, returns the first occurrence. (cost: 1 credit) |
find_majority_elementread-only | Finds the majority element in a list that appears more than ⌊n/2⌋ times using Boyer-Moore voting algorithm. Returns the majority element if it exists, null otherwise. (cost: 1 credit) |
find_max_subarray_sumread-only | Finds the maximum sum of any contiguous subarray using Kadane's algorithm. (cost: 1 credit) |
find_minimum_rotated_sorted_arrayread-only | Finds the minimum element in a rotated sorted array using binary search. The array was originally sorted in ascending order then rotated at some pivot point. (cost: 1 credit) |
find_missing_numberread-only | Finds the missing number in a sequence of integers from 0 to n where exactly one number is missing. Uses sum formula or XOR method. (cost: 1 credit) |
find_next_greater_elementread-only | For each element in a list, finds the next greater element to its right. Returns -1 if no greater element exists. (cost: 1 credit) |
find_n_largestread-only | Finds the n largest numbers from a list and returns them in descending order. (cost: 1 credit) |
find_pairs_with_sumread-only | Finds all unique pairs of integers in a list that sum to a specified target value. Returns pairs as arrays. (cost: 1 credit) |
find_peak_elementread-only | Finds a peak element in a list where an element is greater than its neighbors. Returns the index of any peak element found. (cost: 1 credit) |
flatten_listread-only | Flattens a nested list structure into a single-level list by recursively extracting all elements regardless of nesting depth. (cost: 1 credit) |
is_anagramread-only | Checks if two words are anagrams by comparing if they contain the same characters with the same frequencies, ignoring case and whitespace. (cost: 1 credit) |
is_palindromeread-only | Checks if a string is a valid palindrome, considering only alphanumeric characters and ignoring case and spaces. (cost: 1 credit) |
is_perfect_squareread-only | Checks if a number is a perfect square (i.e., the square of an integer). (cost: 1 credit) |
is_powerread-only | Checks if a given number is an exact integer power of a specified base. Returns true if num = base^k for some non-negative integer k, false otherwise. (cost: 1 credit) |
is_rotationread-only | Checks if one string is a rotation of another string by verifying if str1 appears in str2 concatenated with itself. Returns true if str1 is a rotation of str2, false otherwise. (cost: 1 credit) |
is_sum_of_cubesread-only | Checks if a number equals the sum of the cubes of its digits (e.g., 153 = 1³ + 5³ + 3³). Returns true if the condition holds, false otherwise. (cost: 1 credit) |
is_valid_ip_addressread-only | Validates whether a string is a properly formatted IPv4 address with four octets (0-255) separated by dots. (cost: 1 credit) |
is_valid_parenthesesread-only | Checks if a string contains properly balanced and nested parentheses, brackets, and braces. Returns true if every opening symbol has a matching closing symbol in the correct order. (cost: 1 credit) |
merge_dictionariesread-only | Merges two dictionaries into a single dictionary, with values from the second dictionary overwriting those from the first for duplicate keys. (cost: 1 credit) |
merge_sorted_listsread-only | Merges two sorted lists into a single sorted list maintaining ascending order. Returns the merged sorted list. (cost: 1 credit) |
min_meeting_roomsread-only | Finds the minimum number of meeting rooms required to accommodate all meetings given their time intervals. Uses interval scheduling algorithm. (cost: 1 credit) |
reverse_stringread-only | Reverses the order of characters in a given string, returning the string backwards. (cost: 1 credit) |
sort_numbersread-only | Sorts a list of numbers in ascending order using a deterministic sorting algorithm. (cost: 1 credit) |
validate_sudokuread-only | Checks if a 9x9 Sudoku board is valid by verifying that each row, column, and 3x3 sub-grid contains no duplicate digits 1-9. Returns true if valid, false otherwise. (cost: 1 credit) |
Schemas: list_tools.
And 59 more from this publisher.
{
"name": "uk.co.reliness/code-utilities",
"title": "UK Data: Code utilities",
"$schema": "https://static.modelcontextprotocol.io/schemas/2025-12-11/server.schema.json",
"remotes": [
{
"url": "https://ukdata.reliness.co.uk/mcp/code-utilities",
"type": "streamable-http",
"headers": [
{
"name": "Authorization",
"isSecret": true,
"description": "Optional. Bearer <key> for more than the free daily allowance; free key from POST https://ukdata.reliness.co.uk/keys"
}
]
}
],
"version": "1.5.0",
"websiteUrl": "https://ukdata.reliness.co.uk",
"description": "Deterministic string, list and number routines: palindromes, sorting, searching, validation, merging"
}