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 listJul 27, 2026 14:25Kevin HeaveyKevin HeaveyScore: 60,615Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 15:0160,070304,866,108285,999,0008,344,00020,480
2Jul 27, 2026 15:0160,133304,828,986286,174,0008,481,00020,480
3Jul 27, 2026 15:0160,526306,730,759286,492,00010,087,0002,113,536
4Jul 27, 2026 15:0160,530306,683,227286,492,00010,106,00020,480
5Jul 27, 2026 15:0160,615307,746,173286,090,00010,927,00020,480
6Jul 27, 2026 15:0160,714307,733,335288,493,0009,006,00020,480
7Jul 27, 2026 15:0160,779307,961,239286,001,00011,819,00020,480
8Jul 27, 2026 15:0160,898308,491,102286,041,00012,362,00020,480
9Jul 27, 2026 15:0160,967309,373,838288,758,0009,985,00020,480