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 03:01Victor MerckléVictor MerckléScore: 67,366Success
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 03:0167,282338,887,821327,459,0002,227,0002,113,536
2Jun 12, 2026 03:0167,309338,900,915327,745,0002,071,0002,113,536
3Jun 12, 2026 03:0167,338339,131,715327,927,0002,031,0002,113,536
4Jun 12, 2026 03:0167,357339,223,355328,043,0002,009,0002,113,536
5Jun 12, 2026 03:0167,366339,164,867328,075,0002,021,0002,113,536
6Jun 12, 2026 03:0167,956342,133,209330,923,0002,066,0002,113,536
7Jun 12, 2026 03:0167,987342,266,000331,107,0002,034,0002,113,536
8Jun 12, 2026 03:0168,044342,535,532331,317,0002,102,0002,113,536
9Jun 12, 2026 03:0168,115342,859,427331,763,0002,004,0002,113,536