Surprise Language Round 7

Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.

ContestId
Name
Phase
Frozen
Duration (Seconds)
Relative Time
Start Time
470 Surprise Language Round 7 FINISHED False 7200 321200999 Sept. 13, 2014, 3:30 p.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 95 ) G Hamming Distance PROGRAMMING *special 2500

B"Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different. You are given two strings; calculate the distance between them. The input consists of two lines. Each line contains a string of characters 'A'-'Z' between 1 and 100 characters, inclusive. The strings have equal length. Output Hamming distance between the strings."...

Tutorials

Surprise Language Round #7: editorial

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
40987956 ReaLNero1 G July 30, 2018, 9:38 p.m. OK FALSE TESTS 24 15 0 2500
19138266 DATASOURCE G July 15, 2016, 12:22 a.m. OK FALSE TESTS 24 15 0 2500
18507849 I_Need_Alex_R_Coleman G June 15, 2016, 10:32 p.m. OK FALSE TESTS 24 15 0 2500
15722039 cugel G Feb. 1, 2016, 12:32 a.m. OK FALSE TESTS 24 15 0 2500
13925918 130705009 G Oct. 29, 2015, 3:06 a.m. OK FALSE TESTS 24 15 0 2500
13477178 biltharesatyendra G Oct. 7, 2015, 1:58 p.m. OK FALSE TESTS 24 15 0 2500
10501438 Empress G March 28, 2015, 2:30 p.m. OK FALSE TESTS 24 15 0 2500
10200047 xxxyyyzzz G March 8, 2015, 3 a.m. OK FALSE TESTS 24 15 0 2500
8049095 Dwylkz G Oct. 1, 2014, 3:53 p.m. OK FALSE TESTS 24 15 0 2500
8045904 MVesterli G Oct. 1, 2014, 10:57 a.m. OK FALSE TESTS 24 15 0 2500

remove filters

Back to search problems