Benchmark Information
Tests instruction following capability across 100 steps of increasing complexity, from simple single directives to multi-layered conditional instructions with 50+ requirements. Evaluates precision in following formatting, content, ordering, mathematical, and conditional instructions.
Category:
Instruction Following
Visibility:
PUBLIC
Max Completion Tokens:
20000
Created:
Updated:
Input Tokens:
24992
Est. Output Tokens:
1056
System Prompt
You are a precise instruction follower. Your task is to follow each instruction exactly as specified. Pay careful attention to every detail, including formatting, punctuation, capitalization, word counts, character limits, ordering, and any special requirements. Do not add any extra content beyond what is explicitly requested. When instructions conflict, follow them in the order presented. CRITICAL: For ALL line breaks, you MUST use Windows-style CRLF line endings (carriage return followed by line feed). Never use Unix-style LF-only line endings. Each line break must be the two-character sequence: carriage return (ASCII 13) immediately followed by line feed (ASCII 10). Do not use single-line feed characters. Do not include spaces or new lines unless explicitly requested.
Validation Rules
Exact Instruction Compliance
Exact Match
All Text
Benchmark Steps
# | User Prompt | Exact Instruction Compliance |
---|---|---|
1 | Write the word 'hello'. |
hello |
2 | Write the number 42. |
42 |
3 | Type YES in all caps. |
YES |
4 | Write 'cat' three times separated by spaces. |
cat cat cat |
5 | Output the letter A. |
A |
6 | Type five asterisks. |
***** |
7 | Write 'STOP' followed by an exclamation mark. |
STOP! |
8 | Output the word 'blue' in parentheses. |
(blue) |
9 | Write the digits 1 through 5 with no spaces. |
12345 |
10 | Type 'OK' with a period at the end. |
OK. |
11 | Write the word 'success' with double quotes around it. |
"success" |
12 | Output three question marks. |
??? |
13 | Write 'BEGIN' followed by a colon. |
BEGIN: |
14 | Type the letter X ten times. |
XXXXXXXXXX |
15 | Write 'error' in square brackets. |
[error] |
16 | Output 'PASS' with hyphens before and after. |
-PASS- |
17 | Write the word 'data' backwards. |
atad |
18 | Type 'END' with two periods. |
END.. |
19 | Output the number 100 in lower case words. |
one hundred |
20 | Write 'alpha' followed by a comma and 'beta'. |
alpha,beta |
21 | Type three forward slashes. |
/// |
22 | Write 'TRUE' in curly braces. |
{TRUE} |
23 | Output 'xyz' repeated twice with a dash between. |
xyz-xyz |
24 | Write the Roman numeral for 5. |
V |
25 | Type 'null' with angle brackets. |
<null> |
26 | Write 'GO' three times on the same line. |
GOGOGO |
27 | Output the percent sign five times. |
%%%%% |
28 | Write 'complete' with the first letter capitalized. |
Complete |
29 | Type 'HELLO WORLD' but replace spaces with underscores. |
HELLO_WORLD |
30 | Write the sum of 15 and 27, followed by the word 'total'. |
42total |
31 | Output 'start' in uppercase, then a hyphen, then 'end' in lowercase. |
START-end |
32 | Write a 10-character string using only the letter 'B'. |
BBBBBBBBBB |
33 | Type the alphabet backwards, first 5 letters only, lowercase, no delimiters. |
zyxwv |
34 | Write 'ERROR' three times with exclamation marks between each. |
ERROR!ERROR!ERROR |
35 | Output the number 256 in binary (just 1s and 0s). |
100000000 |
36 | Write 'cat', 'dog', and 'bird' in alphabetical order separated by commas. |
bird,cat,dog |
37 | Type 'YES' if 10 > 5, otherwise type 'NO'. |
YES |
38 | Write the word 'ROBOT' with periods between each letter. |
R.O.B.O.T |
39 | Output exactly 7 hash symbols followed by the word 'tag'. |
#######tag |
40 | Write 'morning' backwards and capitalize the result. |
GNINROM |
41 | Type the product of 8 and 9, then write 'equals' in parentheses. |
72(equals) |
42 | Write 'PASS' if 'apple' comes before 'banana' alphabetically, else 'FAIL'. |
PASS |
43 | Output 'codè' repeated 4 times with no separators. |
codècodècodècodè |
44 | Write the days Mon, Tue, Wed abbreviated and separated by slashes. |
Mon/Tue/Wed |
45 | Type 'VALID' in square brackets if 100 is even, otherwise 'INVALID'. |
[VALID] |
46 | Write exactly 20 characters using alternating X and O. |
XOXOXOXOXOXOXOXOXOXO |
47 | Output the factorial of 5 (5!) followed by a period. |
120. |
48 | Write 'alpha', 'beta', 'gamma' in reverse order with pipes between. |
gamma|beta|alpha |
49 | Type 'TRUE' if the word 'elephant' has 8 letters, else 'FALSE'. |
TRUE |
50 | Write the hex color for pure red in uppercase with the # symbol. |
#FF0000 |
51 | Output 'START' followed by exactly 5 dots, then 'END'. |
START.....END |
52 | Type the word 'SYSTEM' with each letter on a new line. |
S Y S T E M |
53 | Write 'ON' if 50 is divisible by 10, otherwise 'OFF', then add three exclamation marks. |
ON!!! |
54 | Write 'debug' 3 times with underscores between, all uppercase. |
DEBUG_DEBUG_DEBUG |
55 | Type the result of 2^8 (2 to the power of 8), then write 'bits' in parentheses. |
256(bits) |
56 | Create a 5x5 grid of asterisks with spaces between each asterisk and newlines between rows. |
* * * * * * * * * * * * * * * * * * * * * * * * * |
57 | Write the numbers 1-10 in Roman numerals separated by commas, then add ' = X' at the end. |
I,II,III,IV,V,VI,VII,VIII,IX,X = X |
58 | Write exactly 50 characters alternating between 'A' and 'B', starting with 'A', no spaces. |
ABABABABABABABABABABABABABABABABABABABABABABABABAB |
59 | Output the Fibonacci sequence up to 89 (starting with 0), separated by arrows (->). Do not include any spaces. |
0->1->1->2->3->5->8->13->21->34->55->89 |
60 | Write 'PASS' if 'xyz' reversed equals 'zyx', then add the reversed string in square brackets. |
PASS[zyx] |
61 | Type the multiplication table for 7 (7x1 through 7x5) in the format '7x1=7' separated by semicolons. |
7x1=7;7x2=14;7x3=21;7x4=28;7x5=35 |
62 | Output 'DEBUG:' followed by the binary representation of 42 (with no leading 0s), then add ' [OK]'. Do not include any spaces. |
DEBUG:101010[OK] |
63 | Create a countdown from 10 to 1 in the format 'T-10' through 'T-1', separated by spaces, then add 'LAUNCH!' |
T-10 T-9 T-8 T-7 T-6 T-5 T-4 T-3 T-2 T-1 LAUNCH! |
64 | Write 'VALID ' if the sum of digits in 12345 equals 15, then show the calculation in parentheses. |
VALID (1+2+3+4+5=15) |
65 | Output the ASCII values for 'ABC' separated by hyphens, then add ' = ABC' at the end. |
65-66-67 = ABC |
66 | Write a 4x4 square using '+' for corners, '-' for horizontal edges, '|' for vertical edges, and spaces inside. |
+--+ | | | | +--+ |
67 | Type the prime numbers between 1 and 20 in ascending order, separated by commas, then add their count in square brackets. |
2,3,5,7,11,13,17,19[8] |
68 | Write 'ERROR' repeated for exactly 25 characters (including repetitions), then add ':OVERFLOW'. |
ERRORERRORERRORERRORERROR:OVERFLOW |
69 | Output the hex values FF, AA, 00 as decimals separated by colons, then add ' RGB' at the end. |
255:170:0 RGB |
70 | Type a sequence where each number is the sum of its digits from the previous: start with 29, show 5 additional steps, use arrows (->). Do not include spaces. |
29->11->2->2->2->2 |
71 | Write the chemical symbols for Gold, Silver, and Copper in that order, separated by equals signs, then add their atomic numbers in parentheses, separated by commas. |
Au=Ag=Cu(79,47,29) |
72 | Output 'MATCH' if the 10th letter of the alphabet is 'J', then on the same lime add a space and write the entire alphabet in lowercase with the 10th letter in square brackets. |
MATCH abcdefghi[j]klmnopqrstuvwxyz |
73 | Write the powers of 2 from 2^0 to 2^6 in the format '2^n=result', separated by semicolons, then add the sum in brackets. |
2^0=1;2^1=2;2^2=4;2^3=8;2^4=16;2^5=32;2^6=64[127] |
74 | Type 'PASS' if 'listen' and 'silent' are anagrams, then write both words sorted alphabetically by letter. Seperate each item by a space. |
PASS eilnst eilnst |
75 | Output the months Jan through Jun abbreviated, each followed by its number of days, format 'Jan:31', separated by spaces. |
Jan:31 Feb:28 Mar:31 Apr:30 May:31 Jun:30 |
76 | Write a pyramid of stars: 1 star on line 1, 3 on line 2, 5 on line 3, 7 on line 4. Center-align with spaces. Include trailing spaces. |
* *** ***** ******* |
77 | Type the factorial values for 1! through 6! in the format 'n!=value', separated by commas and no spaces, then add a space and their sum in parentheses in the format (Sum:value). |
1!=1,2!=2,3!=6,4!=24,5!=120,6!=720 (Sum:873) |
78 | Write exactly 100 characters by repeating 'TEST' and filling any remainder with 'X'. No spaces. |
TESTTESTTESTTESTTESTTESTTESTTESTTESTTESTTESTTESTTESTTESTTESTTESTTESTTESTTESTTESTTESTTESTTESTTESTTEST |
79 | Output a times table grid for 1-3 multiplied by 1-3, format each as 'n×m=r', arrange in a 3x3 grid with pipes as separators. |
1×1=1|1×2=2|1×3=3 2×1=2|2×2=4|2×3=6 3×1=3|3×2=6|3×3=9 |
80 | 1. Start with 'BEGIN:'. 2. Add the date 'Jan-15-2024'. 3. Insert ' STATUS:'. 4. If 15 is odd, write 'ODD', else 'EVEN'. 5. Add a semicolon. 6. Calculate 15*4. 7. Write 'VALUE='. 8. Add the result from step 6. 9. Insert ' ['. 10. Convert the result to binary. 11. Add ']'. 12. Write ' CHECK:'. 13. If binary has 6 digits, write 'PASS', else 'FAIL'. 14. End with ' :END'. |
BEGIN: Jan-15-2024 STATUS:ODD;VALUE=60 [111100] CHECK:PASS :END |
81 | Create output following these rules: 1. Write 'SEQUENCE:'. 2. Generate first 8 Fibonacci numbers (starting at 1). 3. Separate with arrows (→). 4. After the sequence add ' SUM='. 5. Calculate sum of all 8 numbers. 6. Add the sum. 7. Write ' AVG='. 8. Calculate average to 1 decimal. 9. Add average. 10. Write ' ODD:['. 11. List only odd numbers from sequence. 12. Close with ']'. 13. Write ' EVEN:['. 14. List only even numbers. 15. Close with ']'. Use commas in lists. |
SEQUENCE:1→1→2→3→5→8→13→21 SUM=54 AVG=6.8 ODD:[1,1,3,5,13,21] EVEN:[2,8] |
82 | Build a formatted report: 1. Header 'REPORT-2024' with equals signs on both sides (5 each). 2. New line. 3. Write 'Items:'. 4. List 'Apple', 'Banana', 'Cherry' each on new lines with bullet '- '. 5. New line. 6. Write 'Count: '. 7. Add the number of items. 8. New line. 9. Write 'Letters: '. 10. Count total letters in all items. 11. Add count. 12. New line. 13. Write 'Checksum: '. 14. Add first letter of each item. 15. New line. 16. Footer with 20 dashes. |
=====REPORT-2024===== Items: - Apple - Banana - Cherry Count: 3 Letters: 18 Checksum: ABC -------------------- |
83 | Generate complex string: 1. Start with 'DATA['. 2. Add current year '2024'. 3. Add ']{'. 4. Insert 'MONTH:'. 5. Write 'JAN' if 1st month, 'DEC' if 12th, else 'MID'. 6. Add comma. 7. Write 'QUARTER:'. 8. Calculate which quarter month 6 is in. 9. Write 'Q' plus quarter number. 10. Add '}'. 11. Insert '::'. 12. Write 'FLAGS<'. 13. If year divisible by 4, add 'LEAP,'. 14. If month 6 has 30 days, add 'THIRTY,'. 15. Remove trailing comma. 16. Close with '>'. 17. Add '##'. 18. Calculate year+month+quarter. 19. Add result. 20. End with '##'. |
DATA[2024]{MONTH:MID,QUARTER:Q2}::FLAGS<LEAP,THIRTY>##2032## |
84 | Follow this algorithm: 1. Initialize string with 'CALC:'. 2. Set X=25. 3. Set Y=4. 4. Add '('. 5. Write X value. 6. Add '+'. 7. Write Y value. 8. Add ')'. 9. Calculate X+Y. 10. Add '*2='. 11. Multiply result by 2. 12. Add this result. 13. Write ' HEX:'. 14. Convert to hexadecimal. 15. Add hex value. 16. Write ' BIN:'. 17. Convert original sum to binary. 18. Add binary. 19. Write ' CHECK:'. 20. If binary has exactly 5 digits, write 'VALID5', else 'INVALIDX'. 21. Add ' SQRT:'. 22. Calculate square root of doubled result. 23. Write to 1 decimal place. |
CALC:(25+4)*2=58 HEX:3A BIN:11101 CHECK:VALID5 SQRT:7.6 |
85 | Create encoded message: 1. Start with 'MSG<'. 2. Take word 'HELLO'. 3. Shift each letter by 3 positions forward in alphabet (H->K). 4. Add shifted result. 5. Add '>'. 6. Write ' DECODE<'. 7. Shift each letter back by 3. 8. Add decoded result. 9. Add '>'. 10. Write ' LEN:'. 11. Add length of original word. 12. Write ' VOWELS:'. 13. Count vowels in 'HELLO'. 14. Add count. 15. Write ' CONS:'. 16. Count consonants. 17. Add count. 18. Write ' REV:'. 19. Reverse the original word. 20. Add reversed word. 21. Write ' CHAR['. 22. List ASCII values of original word separated by commas. 23. Close with ']'. |
MSG<KHOOR> DECODE<HELLO> LEN:5 VOWELS:2 CONS:3 REV:OLLEH CHAR[72,69,76,76,79] |
86 | Build math expression evaluator: 1. Write 'EXPR:'. 2. Create expression '((8*3)+(15/3))-7'. 3. Add the expression. 4. Write ' STEPS:['. 5. Calculate 8*3. 6. Write '8*3=24'. 7. Add comma. 8. Calculate 15/3. 9. Write '15/3=5'. 10. Add comma. 11. Calculate 24+5. 12. Write '24+5=29'. 13. Add comma. 14. Calculate 29-7. 15. Write '29-7=22'. 16. Close with ']'. 17. Write ' FINAL:'. 18. Add final result. 19. Write ' DIGITS:'. 20. Count digits in final result. 21. Add count. 22. Write ' EVEN:'. 23. Check if final result is even, write 'YES' or 'NO'. 24. Write ' FACTORS:['. 25. List factors of 22. 26. Close with ']'. |
EXPR:((8*3)+(15/3))-7 STEPS:[8*3=24,15/3=5,24+5=29,29-7=22] FINAL:22 DIGITS:2 EVEN:YES FACTORS:[1,2,11,22] |
87 | Create validation output: 1. Write 'VALIDATE{'. 2. Set test string 'Programming2024!'. 3. Write 'STR:'. 4. Add the string. 5. Write ',LEN:'. 6. Count all characters. 7. Add count. 8. Write ',UPPER:'. 9. Count uppercase letters. 10. Add count. 11. Write ',LOWER:'. 12. Count lowercase. 13. Add count. 14. Write ',DIGIT:'. 15. Count digits. 16. Add count. 17. Write ',SPECIAL:'. 18. Count special characters. 19. Add count. 20. Write ',FIRST:'. 21. Add first character. 22. Write ',LAST:'. 23. Add last character. 24. Write ',MID:'. 25. Add middle character (8th position). 26. Close with '}'. 27. Write ' STRONG:'. 28. If has upper, lower, digit, and special, write 'YES', else 'NO'. |
VALIDATE{STR:Programming2024!,LEN:16,UPPER:1,LOWER:10,DIGIT:4,SPECIAL:1,FIRST:P,LAST:!,MID:m} STRONG:YES |
88 | Generate report with conditions: 1. Write 'STATUS:'. 2. Set value A=45. 3. Set value B=15. 4. If A>B write 'A_GREATER'. 5. Add ' RATIO:'. 6. Calculate A/B. 7. Add ratio. 8. Write ' DIFF:'. 9. Calculate A-B. 10. Add difference. 11. Write ' SUM:'. 12. Calculate A+B. 13. Add sum. 14. Write ' PROD:'. 15. Calculate A*B. 16. Add product. 17. Write ' GCD:'. 18. Find greatest common divisor. 19. Add GCD. 20. Write ' LCM:'. 21. Calculate least common multiple. 22. Add LCM. 23. Write ' PERC:'. 24. Calculate B as percentage of A+B. 25. Add percentage with %. 26. Write ' CLASS:'. 27. If sum>=60 write 'HIGH', if sum>=30 write 'MED', else 'LOW'. |
STATUS:A_GREATER RATIO:3 DIFF:30 SUM:60 PROD:675 GCD:15 LCM:45 PERC:25% CLASS:HIGH |
89 | Create formatted table: 1. Write header 'ID|NAME|SCORE|GRADE'. 2. New line. 3. Add separator '--|----|----|-----'. 4. New line. 5. Add row '01|Alice|95|A'. 6. New line. 7. Add row '02|Bob|82|B'. 8. New line. 9. Add row '03|Carol|78|C'. 10. New line. 11. Add separator '==============='. 12. New line. 13. Write 'TOTAL:'. 14. Sum all scores. 15. Add sum. 16. Write ' AVG:'. 17. Calculate average. 18. Add average. 19. Write ' MAX:'. 20. Find highest score. 21. Add max. 22. Write ' MIN:'. 23. Find lowest score. 24. Add min. 25. Write ' RANGE:'. 26. Calculate max-min. 27. Add range. 28. Write ' PASSED:'. 29. Count scores >=80. 30. Add count. |
ID|NAME|SCORE|GRADE --|----|----|----- 01|Alice|95|A 02|Bob|82|B 03|Carol|78|C =============== TOTAL:255 AVG:85 MAX:95 MIN:78 RANGE:17 PASSED:2 |
90 | Complex pattern generator: 1. Write 'PATTERN:'. 2. Create 5x5 grid. 3. Fill corners with '#'. 4. Fill center with '*'. 5. Fill remaining edges with '-'. 6. Fill other spaces with '.'. 7. Display grid. 8. Write ' COUNTS:'. 9. Count # symbols. 10. Write '#=4'. 11. Count * symbols. 12. Write '*=1'. 13. Count - symbols. 14. Write '-=12'. 15. Count . symbols. 16. Write '.=8'. 17. Write ' CHECKSUM:'. 18. Add all counts. 19. Verify equals 25. 20. If yes write 'OK', else 'ERROR'. |
PATTERN: #---# -...- -.*.. -...- #---# COUNTS:#=4*=1-=12.=8 CHECKSUM:OK |
91 | String transformation chain: 1. Start with 'TRANSFORM:'. 2. Begin with word 'COMPUTER'. 3. Write the word. 4. Add '->'. 5. Remove all vowels. 6. Write result. 7. Add '->'. 8. Reverse the result. 9. Write reversed. 10. Add '->'. 11. Convert to lowercase. 12. Write lowercase. 13. Add '->'. 14. Replace each letter with its position (a=1,b=2...). 15. Write positions separated by dots. 16. Write ' LENGTH:['. 17. Add length at each step separated by commas. 18. Close with ']'. 19. Write ' VOWELS_REMOVED:'. 20. List removed vowels (without delimiters). 21. Write ' FINAL_SUM:'. 22. Sum all position numbers from step 15. |
TRANSFORM:COMPUTER->CMPTR->RTPMC->rtpmc->18.20.16.13.3 LENGTH:[8,5,5,5,13] VOWELS_REMOVED:OUE FINAL_SUM:70 |
92 | Date calculator: 1. Write 'DATE:'. 2. Start with Jan 15, 2024. 3. Write in format 'YYYY-MM-DD'. 4. Write ' DAY:'. 5. Calculate day of week (Monday=1). 6. Write 'Tuesday'. 7. Write ' JULIAN:'. 8. Calculate Julian day (day of year). 9. Add value. 10. Write ' LEAP:'. 11. Check if leap year. 12. Write 'YES' or 'NO'. 13. Write ' Q:'. 14. Determine quarter. 15. Write quarter number. 16. Write ' DAYS_IN_MONTH:'. 17. Write days in January. 18. Write ' DAYS_LEFT:'. 19. Calculate days left in month. 20. Add value. 21. Write ' WEEK:'. 22. Calculate week of year. 23. Add week number. 24. Write ' SEMESTER:'. 25. If month 1-6 write 'S1', else 'S2'. |
DATE:2024-01-15 DAY:Tuesday JULIAN:15 LEAP:YES Q:1 DAYS_IN_MONTH:31 DAYS_LEFT:16 WEEK:3 SEMESTER:S1 |
93 | Create cipher system: 1. Write 'CIPHER{'. 2. Set KEY=3. 3. Set MESSAGE='HELLO WORLD'. 4. Write 'ORIGINAL:'. 5. Add message. 6. Write ',CAESAR:'. 7. Shift each letter by KEY positions. 8. Keep spaces unchanged. 9. Add encrypted message. 10. Write ',REVERSE:'. 11. Reverse the original message. 12. Add reversed. 13. Write ',ATBASH:'. 14. Replace A with Z, B with Y, etc. 15. Add Atbash result. 16. Write ',BINARY:'. 17. Convert first 3 letters to binary. 18. Add binary separated by spaces. 19. Close with '}'. 20. Write ' STATS:['. 21. Count unique letters. 22. Write 'UNIQUE:8'. 23. Count total letters. 24. Write ',TOTAL:10'. 25. Count words. 26. Write ',WORDS:2'. 27. Close with ']'. Do not add new line characters. |
CIPHER{ORIGINAL:HELLO WORLD,CAESAR:KHOOR ZRUOG,REVERSE:DLROW OLLEH,ATBASH:SVOOL DLIOW,BINARY:01001000 01000101 01001100} STATS:[UNIQUE:8,TOTAL:10,WORDS:2] |
94 | Math sequence analyzer: 1. Write 'SEQ:'. 2. Generate sequence where each term is sum of digits of previous squared. 3. Start with 13. 4. Show 6 terms separated by arrows. 5. Write ' ANALYSIS:{'. 6. Write 'MIN:'. 7. Find minimum value. 8. Add min. 9. Write ',MAX:'. 10. Find maximum. 11. Add max. 12. Write ',AVG:'. 13. Calculate average. 14. Round to 1 decimal. 15. Add average. 16. Write ',EVEN:['. 17. List positions of even numbers (1-indexed). 18. Close with ']'. 19. Write ',ODD:['. 20. List positions of odd numbers. 21. Close with ']'. 22. Write ',INCREASING:'. 23. Check if generally increasing trend. 24. Write 'NO'. 25. Write ',PATTERN:'. 26. If sequence repeats, write 'CYCLIC', else 'COMPLEX'. 27. Close with '}'. Do not add new line characters. |
SEQ:13->16->13->16->13->16 ANALYSIS:{MIN:13,MAX:16,AVG:14.5,EVEN:[2,4,6],ODD:[1,3,5],INCREASING:NO,PATTERN:CYCLIC} |
95 | Build URL parser: 1. Write 'URL:'. 2. Use 'https://api.example.com:8080/v2/users?id=123&active=true#section'. 3. Add URL. 4. Write ' PARTS:{'. 5. Write 'PROTOCOL:'. 6. Extract protocol. 7. Add 'https'. 8. Write ',HOST:'. 9. Extract hostname. 10. Add 'api.example.com'. 11. Write ',PORT:'. 12. Extract port. 13. Add '8080'. 14. Write ',PATH:'. 15. Extract path. 16. Add '/v2/users'. 17. Write ',QUERY:'. 18. Extract query string. 19. Add 'id=123&active=true'. 20. Write ',FRAGMENT:'. 21. Extract fragment. 22. Add 'section'. 23. Close with '}'. 24. Write ' PARAMS:['. 25. Parse query parameters. 26. Write 'id=123,active=true'. 27. Close with ']'. 28. Write ' SECURE:'. 29. Check if HTTPS. 30. Write 'YES'. |
URL:https://api.example.com:8080/v2/users?id=123&active=true#section PARTS:{PROTOCOL:https,HOST:api.example.com,PORT:8080,PATH:/v2/users,QUERY:id=123&active=true,FRAGMENT:section} PARAMS:[id=123,active=true] SECURE:YES |
96 | Text Analysis Task: 1. Write 'INPUT:'. 2. Analyze the exact string 'Hello World! Code=123.'. 3. Write the string exactly as given. 4. Write ' ANALYSIS:{'. 5. Write 'TOTAL_CHARS:'. 6. Count every character including spaces and punctuation. 7. Write the count as a number. 8. Write ',LETTERS:'. 9. Count only A-Z and a-z characters. 10. Write the count as a number. 11. Write ',DIGITS:'. 12. Count only 0-9 characters. 13. Write the count as a number. 14. Write ',SPACES:'. 15. Count only space characters (ASCII 32). 16. Write the count as a number. 17. Write ',PUNCTUATION:'. 18. Count only these characters: ! . = 19. Write the count as a number. 20. Write ',UPPERCASE:'. 21. Count only A-Z characters. 22. Write the count as a number. 23. Write ',LOWERCASE:'. 24. Count only a-z characters. 25. Write the count as a number. 26. Write ',VOWELS:'. 27. Count only these characters: a e i o u A E I O U. 28. Write the count as a number. 29. Write ',CONSONANTS:'. 30. Count only letters that are not vowels (b-z excluding vowels, B-Z excluding vowels). 31. Write the count as a number. 32. Write ',FIRST_CHAR:'. 33. Write the first character of the string in single quotes. 34. Write ',LAST_CHAR:'. 35. Write the last character of the string in single quotes. 36. Write ',LENGTH_CATEGORY:'. 37. If total characters are 1-10 write 'SHORT', if 11-20 write 'MEDIUM', if 21+ write 'LONG'. 38. Write the category. 39. Write '}'. 40. Write ' REVERSED:'. 41. Write the original string with character order reversed. 42. End output. |
INPUT:Hello World! Code=123. ANALYSIS:{TOTAL_CHARS:22,LETTERS:14,DIGITS:3,SPACES:2,PUNCTUATION:3,UPPERCASE:3,LOWERCASE:11,VOWELS:5,CONSONANTS:9,FIRST_CHAR:'H',LAST_CHAR:'.',LENGTH_CATEGORY:LONG} REVERSED:.321=edoC !dlroW olleH |
97 | Complex conditional logic: 1. Set X=75, Y=25, Z=50. 2. Write 'EVAL:'. 3. If X>Y AND X>Z write 'X_MAX'. 4. Add ' CALC:{'. 5. Write 'SUM:'. 6. Calculate X+Y+Z. 7. Add sum. 8. Write ',PRODUCT:'. 9. Calculate X*Y*Z. 10. Add product. 11. Write ',MEAN:'. 12. Calculate mean. 13. Add mean. 14. Write ',MEDIAN:'. 15. Find median of X,Y,Z. 16. Add median. 17. Write ',VARIANCE:'. 18. Calculate variance. 19. Round to 1 decimal. 20. Add variance. 21. Close with '}'. 22. Write ' RANGES:['. 23. If 0<=Y<50 write 'Y:LOW,'. 24. If 50<=Z<=100 write 'Z:MID,'. 25. If X>70 write 'X:HIGH'. 26. Close with ']'. 27. Write ' SORTED:'. 28. Sort X,Y,Z ascending. 29. Write with arrows between. 30. Write ' FACTORS:'. 31. Find common factors of all three. 32. List separated by commas. |
EVAL:X_MAX CALC:{SUM:150,PRODUCT:93750,MEAN:50,MEDIAN:50,VARIANCE:416.7} RANGES:[Y:LOW,Z:MID,X:HIGH] SORTED:25->50->75 FACTORS:1,5,25 |
98 | Build complex report following 52 requirements: 1. Write 'REPORT_START:'. 2. Add timestamp '2024-01-15T10:30:00Z'. 3. New line. 4. Write '=====HEADER====='. 5. New line. 6. Write 'Title: Annual Summary'. 7. New line. 8. Write 'Version: 2.1.0'. 9. New line. 10. Write 'Status: ACTIVE'. 11. New line. 12. Write '=====DATA====='. 13. New line. 14. Create table with columns 'Month|Sales|Growth'. 15. New line. 16. Add separator '------|------|------'. 17. New line. 18. Add 'Jan|1000|5%'. 19. New line. 20. Add 'Feb|1050|5%'. 21. New line. 22. Add 'Mar|1100|4.8%'. 23. New line. 24. Write '=====ANALYSIS====='. 25. New line. 26. Write 'Q1 Total: '. 27. Sum Jan-Mar sales. 28. Add sum. 29. Write ' (Target: 3000)'. 30. New line. 31. Write 'Performance: '. 32. If total>3000 write 'ABOVE', else 'MEETS'. 33. New line. 34. Write 'Avg Growth: '. 35. Calculate average of growth percentages. 36. Write '4.93%'. 37. New line. 38. Write '=====FOOTER====='. 39. New line. 40. Write 'Generated: AUTO'. 41. New line. 42. Write 'Checksum: '. 43. Add first letter of each month. 44. Add sum of all sales. 45. Write 'JFM3150'. 46. New line. 47. Write 'Valid: '. 48. If checksum contains '3150' write 'YES'. 49. New line. 50. Write 'END_REPORT'. 51. Count total lines. 52. If count=20 add ' [20 lines]'. |
REPORT_START:2024-01-15T10:30:00Z =====HEADER===== Title: Annual Summary Version: 2.1.0 Status: ACTIVE =====DATA===== Month|Sales|Growth ------|------|------ Jan|1000|5% Feb|1050|5% Mar|1100|4.8% =====ANALYSIS===== Q1 Total: 3150 (Target: 3000) Performance: ABOVE Avg Growth: 4.93% =====FOOTER===== Generated: AUTO Checksum: JFM3150 Valid: YES END_REPORT [20 lines] |
99 | Create a password validator with these exact requirements: 1. Write 'PASSWORD:'. 2. Use the test password 'SecureP@ss2024!'. 3. Add the password. 4. Write ' CHECKS:{'. 5. Write 'LENGTH:'. 6. Count all characters. 7. Add the count. 8. Write ',MIN_8:'. 9. If length >= 8 write 'PASS', else 'FAIL'. 10. Write ',MAX_20:'. 11. If length <= 20 write 'PASS', else 'FAIL'. 12. Write ',UPPERCASE:'. 13. Count uppercase letters. 14. Add count in parentheses. 15. If count >= 1 write 'PASS', else 'FAIL'. 16. Write ',LOWERCASE:'. 17. Count lowercase letters. 18. Add count in parentheses. 19. If count >= 1 write 'PASS', else 'FAIL'. 20. Write ',DIGITS:'. 21. Count numeric digits. 22. Add count in parentheses. 23. If count >= 1 write 'PASS', else 'FAIL'. 24. Write ',SPECIAL:'. 25. Count these characters: !@#$%^&*()_+-=[]{}|;:,.<>?/~` 26. Add count in parentheses. 27. If count >= 1 write 'PASS', else 'FAIL'. 28. Write ',NO_SPACES:'. 29. If password contains no spaces write 'PASS', else 'FAIL'. 30. Write ',NO_REPEATS:'. 31. Check if any character appears 3+ times consecutively. 32. If no 3+ repeats write 'PASS', else 'FAIL'. 33. Write '}'. 34. Write ' STRENGTH:'. 35. Count how many checks passed. 36. If all 8 passed write 'STRONG'. 37. If 6-7 passed write 'MEDIUM'. 38. If less than 6 write 'WEAK'. 39. Write ' SCORE:'. 40. Add number of passed checks. 41. Write '/8'. 42. Write ' HASH:'. 43. Take first 3 and last 3 characters. 44. Write them separated by '...'. 45. Write ' ENTROPY:'. 46. Count unique characters. 47. Add count. 48. Write ' RECOMMEND:'. 49. If strength is 'STRONG' write 'ACCEPTED'. 50. Otherwise write 'REJECTED'. |
PASSWORD:SecureP@ss2024! CHECKS:{LENGTH:15,MIN_8:PASS,MAX_20:PASS,UPPERCASE:(2)PASS,LOWERCASE:(6)PASS,DIGITS:(4)PASS,SPECIAL:(2)PASS,NO_SPACES:PASS,NO_REPEATS:PASS} STRENGTH:STRONG SCORE:8/8 HASH:Sec...24! ENTROPY:13 RECOMMEND:ACCEPTED |
100 | Build a comprehensive data processor with these 50 exact steps: 1. Write 'PROCESSOR:'. 2. Set input string 'DataStream2024'. 3. Add the string. 4. Write ' TRANSFORM:['. 5. Convert to uppercase. 6. Write 'DATASTREAM2024'. 7. Add arrow '->'. 8. Extract only letters. 9. Write 'DATASTREAM'. 10. Add arrow '->'. 11. Count letters. 12. Write '10'. 13. Close with ']'. 14. Write ' HASH:{'. 15. Write 'MD5:'. 16. Take first 8 chars of input. 17. Convert each to ASCII. 18. Sum all ASCII values. 19. Write the sum. 20. Write ',SHA:'. 21. Take last 4 chars '2024'. 22. Multiply digits 2*0*2*4. 23. Write '0'. 24. Write ',CRC:'. 25. Count unique characters in original. 26. Write '13'. 27. Close with '}'. 28. Write ' BINARY:['. 29. Convert first letter 'D' to binary. 30. Write '01000100'. 31. Add comma. 32. Convert last digit '4' (ASCII 52) to binary. 33. Write '00110100'. 34. Close with ']'. 35. Write ' STATS:{'. 36. Write 'ALPHA:'. 37. Count alphabetic chars in original. 38. Write '10'. 39. Write ',NUMERIC:'. 40. Count numeric chars. 41. Write '4'. 42. Write ',RATIO:'. 43. Calculate alpha/numeric. 44. Write '2.5'. 45. Close with '}'. 46. Write ' VALID:'. 47. If contains both letters and numbers write 'YES'. 48. Write ' SCORE:'. 49. Calculate: (unique chars * 2) + (total length). 50. Write '40'. |
PROCESSOR:DataStream2024 TRANSFORM:[DATASTREAM2024->DATASTREAM->10] HASH:{MD5:697,SHA:0,CRC:13} BINARY:[01000100,00110100] STATS:{ALPHA:10,NUMERIC:4,RATIO:2.5} VALID:YES SCORE:40 |
No triggers defined for this benchmark. Create a trigger to automatically run this benchmark when a new model is added that matches your criteria.
No alerts defined for this benchmark. Create an alert to get notified when an execution result matching your criteria performs well on this benchmark.
Model | Reasoning Effort | Strategy | Executions | Accuracy | Cost | Duration |
---|