Unknown Language Round 4

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
130 Unknown Language Round 4 FINISHED False 10800 410021999 Nov. 20, 2011, 3 p.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 502 ) C Decimal sum PROGRAMMING *special 1500

B'You are given an array of integer numbers. Calculate the sum of its elements. The first line of the input contains an integer n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100) -- the size of the array. Next n lines contain the elements of the array, one per line. Each element is an integer between 1 and 100, inclusive. Output the sum of the elements of the array.'...

Tutorials

Unknown Language Round #4: editorial

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
4076047 nealzane C July 15, 2013, 2:25 p.m. OK Befunge TESTS 50 140 0 1500
3816641 yermak0v C June 2, 2013, 6:14 p.m. OK Befunge TESTS 50 140 0 1500
3788949 SuprDewd C May 28, 2013, 6:36 p.m. OK Befunge TESTS 50 140 0 1500
3669382 yagami3566 C May 4, 2013, 1:45 p.m. OK Befunge TESTS 50 140 0 1500
3669371 Omelianenko C May 4, 2013, 1:43 p.m. OK Befunge TESTS 50 140 0 1500
3621989 Phoenyx C April 25, 2013, 3:41 p.m. OK Befunge TESTS 50 140 0 1500
3379393 Swift C March 22, 2013, 9:57 a.m. OK Befunge TESTS 50 140 0 1500
3065033 hariprasath C Feb. 2, 2013, 5:20 p.m. OK Befunge TESTS 50 140 0 1500
3005554 romanychda C Jan. 24, 2013, 10:40 p.m. OK Befunge TESTS 50 140 0 1500
31288570 ljc1301 C Oct. 14, 2017, 3:45 a.m. OK Befunge TESTS 50 156 0 1500

remove filters

Back to search problems