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 09:51wnwnScore: 103,731Success
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 09:52103,204516,649,526503,674,0002,029,0002,113,536
2May 11, 2026 09:52103,253516,634,986503,769,0002,172,0002,113,536
3May 11, 2026 09:52103,574517,690,272505,478,0002,036,0002,113,536
4May 11, 2026 09:52103,658518,932,313505,859,0002,069,0002,113,536
5May 11, 2026 09:52103,731517,364,484506,272,0002,014,0002,113,536
6May 11, 2026 09:52103,841518,880,625506,774,0002,048,0002,113,536
7May 11, 2026 09:52103,869517,661,390506,939,0002,021,0002,113,536
8May 11, 2026 09:52103,875519,484,543506,982,0002,008,0002,113,536
9May 11, 2026 09:52103,927518,589,302507,230,0002,015,0002,113,536