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 11, 2026 13:13wnwnScore: 105,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 13:14104,680523,643,639510,888,0002,046,0002,113,536
2May 11, 2026 13:14104,706521,811,741511,053,0002,010,0002,113,536
3May 11, 2026 13:14104,922522,883,143512,060,0002,060,0002,113,536
4May 11, 2026 13:14105,142523,966,118513,192,0002,007,0002,113,536
5May 11, 2026 13:14105,492525,602,114514,866,0002,047,0002,113,536
6May 11, 2026 13:14108,949542,567,601531,779,0002,074,0002,113,536
7May 11, 2026 13:14108,981544,684,342531,957,0002,054,0002,113,536
8May 11, 2026 13:14109,721547,067,669535,614,0002,022,0002,113,536
9May 11, 2026 13:14126,015628,241,065615,244,0002,233,0002,113,536