Unknown Language Round 2

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
72 Unknown Language Round 2 FINISHED False 10800 431185799 March 20, 2011, 4:10 p.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 75 ) D Perse-script PROGRAMMING *special expression parsing 2400

B''...

Tutorials

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
1125022 ZhouYuChen D Jan. 29, 2012, 8:55 a.m. OK Io TESTS 25 170 4608000 2400
353589 loro D March 24, 2011, 5:31 p.m. OK Io TESTS 26 170 4608000 2400
346681 ashi009 D March 20, 2011, 8:41 p.m. OK Io TESTS 26 170 4608000 2400
346360 tomek D March 20, 2011, 6:49 p.m. OK Io TESTS 26 170 4608000 2400
3818161 yermak0v D June 3, 2013, 9:28 a.m. OK Io TESTS 25 171 0 2400
3669342 Omelianenko D May 4, 2013, 1:38 p.m. OK Io TESTS 25 171 307200 2400
64570553 steven1029 D Nov. 9, 2019, 9 a.m. OK Io TESTS 25 186 0 2400
45851256 yongwhan D Nov. 16, 2018, 11:38 p.m. OK Io TESTS 25 186 0 2400
14028809 Roms D Nov. 2, 2015, 2:35 p.m. OK Io TESTS 25 186 0 2400
13830222 130705009 D Oct. 24, 2015, 7:28 p.m. OK Io TESTS 25 186 0 2400

remove filters

Back to search problems