Pretty sure the last dataset is still bugged with C++, my solution is completing in 48ms locally and typically under 32ms on the CodinGame IDE, I have also timed the printing of the output buffer locally which is under 1ms. Even still I am getting timed out only on the last dataset.
Code is here: CodinGame Mime Type - Pastebin.com
If it requires optimization further than this then it surely should not qualify as an easy puzzle.
@Leweh:
I agree, as long as this puzzle is in the easy category, the solution shouldnât require advanced optimizations. Especially considering that they are not necessary in the other languages.
Is it possible to beat the âLarge Datasetâ test on C++? Tried it for a while and have 100% in validation but this test still has timeout.
The same thing is being discussed in the several posts literally just above yours.
My program got the âProcess has timed out.â verdict in the âLarge datasetâ sample test case but it still got 100% score when submitted.
Hi, iâm using c++ and a unoredred_map, but i kept failing the 5th test, (Large dataset test), however it seems my code was almost as efficient as it could be, so i submitted it and passed every single test, includind the 10th test (Large dataset test), so i guess thereâs a bug that came back, gl everyone
never doubt your code, when it fails itâs always the test thatâs the problem !
Not always; it just so happens thatâs the case for this puzzle.
Can someone help me with my C++? I was using this problem to relearn it (didnt use it in decades).
I am hitting the time limit in the last test case. I believe Iâm not doing nothing wrong algorithmically, I think it must be something that in C++ is time consuming.
Can someone spot it?
[Mod edit: Please avoid posting codes on the forum.]
Please refer to the messages just above yours. This is actually a known issue in C++ related to this puzzle. If you check the previous messages just above yours, youâll find some discussion about it. Iâll report it to the staff as well, though that wonât happen any time soon (because Iâve already submitted a few other bug reports that are still pending).
oh, sorry, didnât check other messages. As this was my first exercise in C++ I assumed the issue should be on me. thanks!
In C it is pure pain.
The line lengh is unknown so it just copy 257 chars everytime which ends up being garbage data at the end.
I have to do
if(EXT[j] != 0)
To get rid of the trash data.
Everything pass except the large dataset because of time constraint as if my code was not optimized but it is. Itâs just that I have to add these extra loop to clean the garbage that codingame is not able to properly formulate because they donât add a simple fckin \0 like anyone with triple digit iq⌠trully pathetic
EDIT : changing a comment makes me get 100%.
Mods, your website sucks xd
Nothing to do with mods. Mods donât create or moderate that puzzle, nor do mods own this website.
I have this code and it doesnt work:
f_extension = fname.split(".")[1].lower()
Your code doesnât work for some file names, e.g. these names in Test 3 (âCorrect division of the extensionâ):
b.wav.tmp
pdf
report..pdf
.mp3.
can you give some hints on how to properly split the extensions
First line of the second paragraph of the rules sections reads:
The extension of a file is defined as the substring which follows the last occurrence, if any, of the dot character within the file name.
If you need anything else, just let me know! 
so for
b.wav.tmp
the extension is .tmp?
Yes.
You could also look at the inputs and outputs and see what the result is meant to be, and work backwards.
Good luck 
Ok, I completed tht testcase
But my code now doesnt really work with upper/lower case handling
partial code:
for i in range(n):
# ext: file extension
# mt: MIME type.
ext, mt = input().split()
ext_mt_dict[ext.lower()] = mt.lower()
#later on
f_extension = fname.split(".")[-1].lower()