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 10, 2021 14:11Dmitry DolgopolovDmitry DolgopolovScore: 620,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2021 14:11613,29812,741,779,5623,005,160,69402,191,360
2Jun 10, 2021 14:11620,37912,999,074,2563,039,857,25902,293,760
3Jun 10, 2021 14:11633,45713,151,439,2033,103,937,06402,277,376