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 listJun 5, 2026 00:24Victor MerckléVictor MerckléScore: 60,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 00:2460,375304,938,290293,655,0002,186,0002,113,536
2Jun 5, 2026 00:2460,391305,003,506293,913,0002,007,0002,113,536
3Jun 5, 2026 00:2460,396305,165,872293,922,0002,022,0002,113,536
4Jun 5, 2026 00:2460,397305,080,434293,922,0002,025,0002,113,536
5Jun 5, 2026 00:2460,400305,133,212293,734,0002,227,0002,113,536
6Jun 5, 2026 00:2460,421305,230,463293,905,0002,162,0002,113,536
7Jun 5, 2026 00:2460,439305,268,141293,927,0002,226,0002,113,536
8Jun 5, 2026 00:2460,474305,455,491294,144,0002,180,0002,113,536
9Jun 5, 2026 00:2462,656316,174,562304,779,0002,238,0002,113,536