UK Data: Code utilities is answering right now. Last checked moments ago. It exposes 32 tools.
Deterministic string, list and number routines: palindromes, sorting, searching, validation, merging
Uptime history
18 hours of history
18 hours agonow
100.0%
Uptime 24h
65 of 65 checks
32
Tools
read from the server
235 ms
Response time
average over 24h
open, no key
Access
streamable-http
Nothing serious here today
Today is the operative word: we check UK Data: Code utilities every 15 minutes and re-read its code on every release. Watch it and you find out the day that stops being true.
Connect this server
Endpoint below is the one we actually reach during checks — not the one copied from a README. Last verified 0 min ago.
run in your terminal
claude mcp add code-utilities --transport http https://ukdata.reliness.co.uk/mcp/code-utilitiesSettings → Connectors → Add custom connector, then paste this address
https://ukdata.reliness.co.uk/mcp/code-utilities~/.codex/config.toml
[mcp_servers.code-utilities]
url = "https://ukdata.reliness.co.uk/mcp/code-utilities".cursor/mcp.json
{
"mcpServers": {
"code-utilities": {
"url": "https://ukdata.reliness.co.uk/mcp/code-utilities"
}
}
}.vscode/mcp.json
{
"servers": {
"code-utilities": {
"type": "http",
"url": "https://ukdata.reliness.co.uk/mcp/code-utilities"
}
}
}Available tools 32
Read directly from the server with tools/list, grouped by what they act on.
If a tool disappears, we record the date.
binary
binary_addition
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_search
Performs binary search on a sorted list to find the index of a target value, returning -1 if not found. (cost: 1 credit)
merge
merge_dictionaries
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_lists
Merges two sorted lists into a single sorted list maintaining ascending order. Returns the merged sorted list. (cost: 1 credit)
valid
is_valid_ip_address
Validates whether a string is a properly formatted IPv4 address with four octets (0-255) separated by dots. (cost: 1 credit)
is_valid_parentheses
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)
anagram
is_anagram
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)
can
can_attend_meetings
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
count_bits
Counts the number of set bits (1's) in the binary representation of a non-negative integer. (cost: 1 credit)
duplicate
find_duplicate_number
Finds the duplicate number in a list of integers where exactly one number appears more than once. Returns the duplicate value. (cost: 1 credit)
equilibrium
find_equilibrium_index
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)
first
find_first_non_repeating_char
Finds the first character in a string that appears only once. Returns null if all characters repeat. (cost: 1 credit)
flatten
flatten_list
Flattens a nested list structure into a single-level list by recursively extracting all elements regardless of nesting depth. (cost: 1 credit)
kth
find_kth_smallest
Finds the kth smallest number in an unsorted list (1-indexed, where k=1 returns the smallest element). (cost: 1 credit)
largest
find_n_largest
Finds the n largest numbers from a list and returns them in descending order. (cost: 1 credit)
longest
find_longest_word
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)
majority
find_majority_element
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)
max
find_max_subarray_sum
Finds the maximum sum of any contiguous subarray using Kadane's algorithm. (cost: 1 credit)
min
min_meeting_rooms
Finds the minimum number of meeting rooms required to accommodate all meetings given their time intervals. Uses interval scheduling algorithm. (cost: 1 credit)
minimum
find_minimum_rotated_sorted_array
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)
missing
find_missing_number
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)
next
find_next_greater_element
For each element in a list, finds the next greater element to its right. Returns -1 if no greater element exists. (cost: 1 credit)
pairs
find_pairs_with_sum
Finds all unique pairs of integers in a list that sum to a specified target value. Returns pairs as arrays. (cost: 1 credit)
palindrome
is_palindrome
Checks if a string is a valid palindrome, considering only alphanumeric characters and ignoring case and spaces. (cost: 1 credit)
peak
find_peak_element
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)
perfect
is_perfect_square
Checks if a number is a perfect square (i.e., the square of an integer). (cost: 1 credit)
power
is_power
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)
reverse
reverse_string
Reverses the order of characters in a given string, returning the string backwards. (cost: 1 credit)
rotation
is_rotation
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)
sort
sort_numbers
Sorts a list of numbers in ascending order using a deterministic sorting algorithm. (cost: 1 credit)
sum
is_sum_of_cubes
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)
validate
validate_sudoku
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)
Endpoints
| URL | Transport | State | Latency | Checked |
|---|---|---|---|---|
| https://ukdata.reliness.co.uk/mcp/code-utilities | streamable-http | answering | 93 ms | 0 min ago |
Alternatives to UK Data: Code utilities
same job, measured the same wayPython Code Validator
by jkanselaar
Validates AI-generated Python: syntax, lint, security scan and deterministic repair.
Deterministic
by archradhq
Deterministic IR/IR-LINT validation, policy packs, drift vs exports (archrad). Apache-2.0.
Hexadata Tools
by 4robot
15 deterministic validation tools for AI agents: tax IDs (15 countries), VAT, IBAN, LEI, HS codes.
UK Data: Compliance and finance checks
by co-reliness
LEI lookups with parent companies (GLEIF), IBAN validation and UK sort code checks
Research Repo Doctor
by tom409114
Deterministic Artifact Evaluation preflight and run-path grader for research repositories.
GitHits
by githits
Search public open-source code, documentation, metadata, vulnerabilities, changelogs, and examples.
Worldref
by arj-89
Every country in Arabic and English: names, nationalities, dial codes, phone validation.
JP Data (Japanese Public Business Data)
by kimotostudio
Japanese open-data MCP server: corporate-number validation, zengin bank codes, national holidays
UK Data: Code utilities — questions
Answers built from our own checks of this server.
What can UK Data: Code utilities do?
It exposes 32 tools, read directly from the server on our last check. Among them: binary_addition, binary_search, can_attend_meetings, count_bits, find_duplicate_number, find_equilibrium_index and 26 more. The full list with descriptions is on this page — we take it from the server itself via tools/list, not from a README.
How MCP servers expose tools in the first place →
What is UK Data: Code utilities mostly used for?
Its tools cluster around merge, binary and valid. That is what this server is built to work with — the grouping comes from the actual tool names, not from a category we assigned.
Is UK Data: Code utilities working right now?
We send a real MCP handshake every 15 minutes. Over the last 24 hours 65 of 65 checks got a reply (100.0%), average response time 235 ms. The bar chart above shows every period we have measured.
How do I connect UK Data: Code utilities?
Copy the ready config from this page. We generate it for Claude Code, Claude Desktop, Codex, Cursor and VS Code, each in the form that client actually reads. It is a remote server, so there is nothing to install — the client connects to the address.
Does UK Data: Code utilities need an API key?
No. UK Data: Code utilities completed a full MCP handshake with us as an anonymous client and listed its tools without asking for anything. All 32 of them are readable on this page. This is what we observed, not what the docs claim.
How fast is UK Data: Code utilities?
It answers our handshake in 235 ms on average, which is faster than 57% of all working MCP servers we measure. The comparison comes from our own checks across the whole registry, every 15 minutes.