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 listAug 2, 2026 11:45Josu San MartinJosu San MartinScore: 31,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 11:4531,766166,411,487154,532,0001,122,0002,113,536
2Aug 2, 2026 11:4531,769166,535,596154,535,0001,134,0002,113,536
3Aug 2, 2026 11:4531,774165,723,606154,561,0001,135,0002,113,536
4Aug 2, 2026 11:4531,790166,554,933154,659,0001,114,0002,113,536
5Aug 2, 2026 11:4531,805166,676,504154,707,0001,138,0002,113,536
6Aug 2, 2026 11:4531,807165,898,133154,719,0001,137,0002,113,536
7Aug 2, 2026 11:4531,824165,998,873154,812,0001,129,0002,113,536
8Aug 2, 2026 11:4532,010166,914,255155,728,0001,125,0002,113,536
9Aug 2, 2026 11:4532,030167,762,396155,813,0001,137,0002,113,536