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 listMar 30, 2026 00:32Dominique GarmierDominique GarmierScore: 159,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 00:32157,924800,216,728770,831,0002,999,0002,289,664
2Mar 30, 2026 10:09158,848807,107,704777,354,000999,0002,424,832
3Mar 30, 2026 10:09159,146806,104,372777,818,0001,999,0002,416,640
4Mar 30, 2026 00:32159,612814,794,902782,097,00002,289,664
5Mar 30, 2026 00:32159,678811,649,102780,423,0001,998,0002,433,024
6Mar 30, 2026 10:09160,021812,456,672782,105,0002,000,0002,289,664