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:02Kevin HeaveyKevin HeaveyScore: 52,300Success
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 14:2651,796263,919,825247,399,0006,406,00020,480
2Jul 27, 2026 14:2651,866264,228,757247,152,0006,995,0002,113,536
3Jul 27, 2026 14:2652,071265,256,289247,220,0007,931,00020,480
4Jul 27, 2026 14:2652,108265,443,773247,159,0008,171,00020,480
5Jul 27, 2026 14:2652,300267,126,832247,491,0008,782,00020,480
6Jul 27, 2026 14:2652,328266,510,975247,263,0009,147,0002,113,536
7Jul 27, 2026 14:2652,368266,730,303247,851,0008,753,00020,480
8Jul 27, 2026 14:2652,405267,787,511247,329,0009,459,00020,480
9Jul 27, 2026 14:2652,802268,777,392247,036,00011,694,00020,480