• Sign Up
    Time to claim your honor
  • Training
  • Practice
    Complete challenging Kata to earn honor and ranks. Re-train to hone technique
  • Freestyle Sparring
    Take turns remixing and refactoring others code through Kumite
  • Community
  • Leaderboards
    Achieve honor and move up the global leaderboards
  • Chat
    Join our Discord server and chat with your fellow code warriors
  • Discussions
    View our Github Discussions board to discuss general Codewars topics
  • About
  • Docs
    Learn about all of the different aspects of Codewars
  • Blog
    Read the latest news from Codewars and the community
  • Log In
  • Sign Up
psytech140 Avatar
Name:Sam H
Clan:ITC
Member Since:Sep 2015
Last Seen:Jun 2021
Profiles:
Following:17
Followers:19
Allies:17
View Profile Badges
  • Stats
  • Kata
  • Collections
  • Kumite
  • Social
  • Discourse
  • Conversations (44)
  • Replies
  • Authored
  • Needs Resolution
  • Custom User Avatar
    • ahmet_popaj
    • commented on "Endianness Conversion" kata
    • 13 months ago

    Pretty funny kata, congratulations.

  • Custom User Avatar
    • stellartux
    • created a suggestion for "Endianness Conversion" kata
    • 13 months ago

    Prolog translation

  • Custom User Avatar
    • kckennylau
    • created an issue for "Endianness Conversion" kata
    • 14 months ago

    "The bit size must be a power of 2 greater than or equal to 8." is not currently being tested, and there are some answers that just require it to be a multiple of 8.

  • Custom User Avatar
    • Just4FunCoder
    • resolved a suggestion on "Endianness Conversion" kata
    • 16 months ago

    Approved

  • Custom User Avatar
    • jpssj
    • created a suggestion for "Endianness Conversion" kata
    • 16 months ago

    Python fork that fixes that issue (not testing negative input).

  • Custom User Avatar
    • scarecrw
    • created an issue for "Endianness Conversion" kata
    • 16 months ago

    Missing random tests in Ruby.

  • Custom User Avatar
    • scarecrw
    • created an issue for "Endianness Conversion" kata
    • 16 months ago

    Your function should return a None value if the integer is negative

    This isn't currently being tested in python or ruby.

  • Custom User Avatar
    • jpssj
    • resolved an issue on "Endianness Conversion" kata
    • 16 months ago

    Approved.

  • Custom User Avatar
    • seniorCrutchDeveloper
    • commented on "Implementing SHA-1" kata
    • 17 months ago

    Basically everything you need to do:

    class SHA1:
        def __init__(self) -> None:
            self._message = b''
    
        def update(self, message: bytes) -> None:
            self._message += message
    
        def digest(self) -> bytes:
            """Compute hash for self._message"""
    

    After calling the update(message) method, you update the variable inside the class. When digest() is called, you work with this previously saved variable.
    I checked, scripts of multiple calls to update() are not tested. For a single instance of a class, the update() method is called once.
    p.s. Judging by your code, you are on the right track.

  • Custom User Avatar
    • KayleighWasTaken
    • created a suggestion for "Simple RSA Implementation" kata
    • 2 years ago

    Scala translation

  • Custom User Avatar
    • FirstFlush
    • created a question for "Implementing SHA-1" kata
    • 2 years ago

    I don't understand the purpose of the 'update' method (python).

    Is this were the SHA1 padding/preprocessing is to take place?

  • Custom User Avatar
    • SagePtr
    • created a suggestion for "Endianness Conversion" kata
    • 2 years ago

    TypeScript translation

  • Custom User Avatar
    • avermakov
    • commented on "Endianness Conversion" kata
    • 2 years ago

    Python fork

    • Adds random tests (64...1024) bits
    • Update to new test framework
  • Custom User Avatar
    • Madjosz
    • commented on "Endianness Conversion" kata
    • 2 years ago

    Endianness is a way of storing numbers in memory. There are two ways to do this, called big-endian and little-endian. In big-endian, the most significant byte is stored first, and in little-endian, the least significant byte is stored first.

    Here's an example: let's say we have the number 12345. In big-endian, this would be stored as 0x05040302, because the most significant byte is 0x05. In little-endian, it would be stored as 0x02030405, because the least significant byte is 0x02.

    Endianness can be important when you're working with data that's been stored in a file or transmitted over a network. If you don't know the endianness of the data, you could end up interpreting it incorrectly.

    Here's a simple way to remember the difference between big-endian and little-endian: big-endian is like a big person, who puts their biggest shoe on first. Little-endian is like a little person, who puts their littlest shoe on first.

    (Brought to you by PaLM 2)

  • Custom User Avatar
    • Kees de Vreugd
    • commented on "Endianness Conversion" kata
    • 2 years ago

    explain it to me like I'm a five year old.

  • Loading more items...
  • © 2025 Codewars
  • About
  • API
  • Blog
  • Privacy
  • Terms
  • Code of Conduct
  • Contact

Confirm

  • Cancel
  • Confirm

Collect: undefined

Loading collection data...