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:44wnwnScore: 199,243Success
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:46193,758958,148,907948,405,0001,012,0002,113,536
2May 11, 2026 09:46197,105976,205,366964,815,0001,002,0002,113,536
3May 11, 2026 09:46197,643977,780,079967,453,0001,002,0002,113,536
4May 11, 2026 09:46198,604983,959,540971,089,0002,075,0002,113,536
5May 11, 2026 09:46199,243985,028,134975,276,0001,017,0002,113,536
6May 11, 2026 09:46199,425986,399,988976,184,0001,002,0002,113,536
7May 11, 2026 09:46200,727994,087,152981,562,0002,004,0002,113,536
8May 11, 2026 09:46200,876993,962,541983,292,0001,001,0002,113,536
9May 11, 2026 09:46202,242999,746,896989,986,0001,002,0002,113,536