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 listMay 6, 2025 14:05KeefeKeefeScore: 245,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2025 14:02244,8661,227,025,2351,197,847,0001,998,0002,441,216
2May 6, 2025 14:02244,9631,230,146,9061,199,318,000999,0002,273,280
3May 6, 2025 14:02245,0001,227,395,0451,199,500,000999,0002,306,048
4May 6, 2025 14:05245,0241,229,832,9631,200,619,00002,273,280
5May 6, 2025 14:05245,0891,225,978,4671,197,938,0002,997,0002,449,408
6May 6, 2025 14:05245,1001,222,276,6421,199,989,000999,0002,273,280