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 listJun 1, 2024 19:23Andrey TsvetkovAndrey TsvetkovScore: 1,499,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2024 19:231,495,2987,399,784,6827,326,959,20402,179,072
2Jun 1, 2024 19:231,499,1627,415,201,5497,345,892,79702,174,976
3Jun 1, 2024 19:231,500,6567,418,888,1277,353,214,59002,191,360