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 12, 2026 02:51Victor MerckléVictor MerckléScore: 57,042Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 02:5156,970288,296,440277,145,0002,011,0002,113,536
2Jun 12, 2026 02:5156,978288,309,383277,185,0002,011,0002,113,536
3Jun 12, 2026 02:5157,037288,666,862277,475,0002,010,0002,113,536
4Jun 12, 2026 02:5157,038288,671,085277,476,0002,012,0002,113,536
5Jun 12, 2026 02:5157,042289,019,210277,493,0002,013,0002,113,536
6Jun 12, 2026 02:5157,444290,597,881279,463,0002,013,0002,113,536
7Jun 12, 2026 02:5157,481290,889,170279,646,0002,012,0002,113,536
8Jun 12, 2026 02:5158,289295,023,945283,607,0002,011,0002,113,536
9Jun 12, 2026 02:5158,308295,050,770283,701,0002,012,0002,113,536