Under construction

Still being built. Things may change

SHA-1

Time limit1sMemory limit256 MB

Summary
Given an alphanumeric string of length 1 to 50, print its SHA-1 hash as 40 lowercase hex digits.
Level

Medium4 of 10

Topics
Implementation, Simulation, Bit manipulation
Solved
No attempts yet

Problem

SHA-1 is a hash function that reduces any byte sequence to a single 160-bit value. Given a string SS, read SS as ASCII bytes and compute its SHA-1 hash.

Input

The first line contains the string SS. SS consists only of uppercase letters, lowercase letters, and digits, and its length is between 1 and 50.

Output

Print the SHA-1 hash of SS on the first line as 40 lowercase hexadecimal digits.

Examples2

  1. Example 1

    Input
    HelloWorld
    Expected output
    db8ac1c259eb89d4a131b253bacfca5f319d54f2

  2. Example 2

    Input
    abc
    Expected output
    a9993e364706816aba3e25717850c26c9cd0d89d