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 26, 2026 10:32Dominique GarmierDominique GarmierScore: 231,118Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 18:54231,0131,159,665,1821,129,964,0001,998,0002,277,376
2Mar 25, 2026 18:54231,0231,159,170,6291,130,017,0001,998,0002,277,376
3Mar 25, 2026 18:54231,0411,153,065,3991,130,105,0001,998,0002,277,376
4Mar 25, 2026 18:54231,0771,159,018,3901,130,278,0001,998,0002,482,176
5Mar 25, 2026 18:54231,1181,150,879,6251,131,477,000999,0002,478,080
6Mar 25, 2026 18:54231,1531,157,501,7691,131,649,000999,0002,277,376
7Mar 26, 2026 10:32231,2971,156,941,0951,132,355,000999,0002,469,888
8Mar 26, 2026 10:32231,3191,154,643,1021,132,466,000999,0002,277,376
9Mar 26, 2026 10:32231,4171,161,063,6021,131,947,0001,998,0002,277,376