Back
Close

Another base

Statement

 Goal

Give the ASCII representation of the hex encoded values
Input
Line 1: An integer N for the amount of values to decode
Next N lines: An hex value C representing an ASCII character
Output
A single line containing the decoded ASCII characers.
Constraints
N < 100
00 ≤ C ≤ ff
Example
Input
11
68
65
6c
6c
6f
20
77
6f
72
6c
64
Output
hello world

Game modes
Fastest, Shortest, Reverse

Test cases
hello world Test
Input
11 68 65 6c 6c 6f 20 77 6f 72 6c 64
Output
hello world

Validate lower case letters Validator
Input
10 6c 6f 77 65 72 20 63 61 73 65
Output
lower case

HELLO WORLD Test
Input
11 48 45 4c 4c 4f 20 57 4f 52 4c 44
Output
HELLO WORLD

Validate upper case letters Validator
Input
10 55 50 50 45 52 20 43 41 53 45
Output
UPPER CASE

Testing 1234567890 Test
Input
18 54 65 73 74 69 6e 67 20 31 32 33 34 35 36 37 38 39 30
Output
Testing 1234567890

Validate numbers Validator
Input
17 30 31 32 33 34 35 36 37 38 39 20 74 65 73 74 65 64
Output
0123456789 tested

$PE(!@|_ Test
Input
8 24 50 45 28 21 40 7c 5f
Output
$PE(!@|_

Validate special characters Validator
Input
10 28 29 54 7c 2d 7c 45 7c 3e 3f
Output
()T|-|E|>?

/-\lL T093thEr N()\/\/!! Test
Input
24 2f 2d 5c 6c 4c 20 54 30 39 33 74 68 45 72 20 4e 28 29 5c 2f 5c 2f 21 21
Output
/-\lL T093thEr N()\/\/!!

Validate combined Validator
Input
13 28 30 7c 5c 2f 7c 7c 7d 5d 5b 6e 45 44
Output
(0|\/||}][nED

wisdom Test
Input
55 54 68 65 20 66 6f 6f 6c 20 77 61 73 20 6e 6f 74 20 61 77 61 72 65 20 69 74 20 77 61 73 20 69 6d 70 6f 73 73 69 62 6c 65 2c 20 73 6f 20 68 65 20 64 69 64 20 69 74 2e
Output
The fool was not aware it was impossible, so he did it.

Validator 6 Validator
Input
40 53 74 72 61 6e 67 65 72 73 20 61 72 65 20 73 74 72 61 6e 67 65 72 73 2c 20 75 6e 69 6c 20 74 68 65 79 20 6d 65 65 74 2e
Output
Strangers are strangers, unil they meet.

Solution language

Solution

Stub generator input