Loading collection data...
Collections are a way for you to organize kata so that you can create your own training routines. Every collection you create is public and automatically sharable with other warriors. After you have added a few kata to a collection you and others can train on the kata contained within the collection.
Get started now by creating a new collection.
Swear this is a trick question to see if people remember order of operations
This comment is hidden because it contains spoiler information about the solution
shellcode
shellcode
This is exclusively for PostgreSQL?
I figured it out :D thank you so much!
Oh i'm sorry, I got confused lol. Thank you for responding!
This comment is hidden because it contains spoiler information about the solution
I also was not able to find a solution shorter than 10 bytes.
long double
has 10 bytes which can be used for opcodes (it occupies 16 bytes in memory but 6 bytes are always 0).Hey, I noticed you used the opcodes to represent a value, and I’m curious... do the opcodes really only fit into 8 bytes, or is it something larger like 16 bytes? Maybe the compiler or system is using some kind of optimization to make the floating-point constant smaller, or is there a specific reason why it fits into only 8 bytes?
I understood how you did this last time with the 16-byte long double, but I can’t seem to get this to work because the smallest amount of opcodes I can get is 10 bytes. Could you clarify the actual size of the opcodes used and how you managed to do this?
Oh, that's so cool! Thank you so much for explaining the process in detail. I really appreciate it!
This comment is hidden because it contains spoiler information about the solution
Hey, I saw your solution for the "Volume of Cuboid" problem on CodeWars, and I’m really curious about how you came up with the constant 1.5249269223191329542e+59L. You mentioned that the solution and test code are in separate compilation units, and that the type of getVolumeOfCuboid doesn’t matter for successful compilation. I’m really interested in how you figured out that this constant could replace the multiplication logic.
Did you use Clang 8 locally with a debugger or disassembler to analyze this? Specifically, I’m wondering at what stage this constant gets optimized or inserted into the executable—was it during the LLVM intermediate representation (IR) phase, during optimization, or when the machine code was being generated? How did you pinpoint that particular constant, and what part of the compilation process made it work in place of the expected calculation?
Also, if you did this locally, how did you transfer the test code from CodeWars and run it in your local environment? I’d love to hear about the setup you used and the process you followed to make it work locally. Was it necessary to use Criterion locally for testing, or is it irrelevant in this case?
wow man thats hella creative
didn't know this exists
Loading more items...