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 listFeb 5, 2025 12:26Oleg KovalovOleg KovalovScore: 2,416,249Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2025 12:262,415,74011,874,682,16211,831,130,0005,995,0002,514,944
2Feb 5, 2025 12:262,416,24911,875,562,46411,831,629,0007,993,0002,465,792
3Feb 5, 2025 12:262,418,96011,893,728,64411,833,919,00018,985,0002,396,160