Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listDec 27, 2023 10:04matsuoka-601matsuoka-601Error
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2023 10:0400000Error: expected "560374413381 ", got "2239164316556597526 2533274790920192 2170761507962099986 34359738377 0 0 333 5 6 21814785 "
2Dec 27, 2023 10:0700000Error: expected "560373623629 ", got "2533042974353928491 4785074605391872 1157733010759881747 25769803779 0 0 333 9 4 21819673 "
3Dec 27, 2023 10:0700000Error: expected "560380932176 ", got "1736739188601923358 2814749768024064 3396024400949684790 55834574861 0 0 333 7 9 21777920 "