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 listMay 11, 2026 15:02Victor MerckléVictor MerckléScore: 92,569Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 15:0391,984459,810,756448,587,0002,139,0002,113,536
2May 11, 2026 15:0392,501462,649,293451,059,0002,200,0002,113,536
3May 11, 2026 15:0392,548462,352,947451,274,0002,214,0002,113,536
4May 11, 2026 15:0392,563462,566,148451,393,0002,166,0002,113,536
5May 11, 2026 15:0392,569463,316,530451,441,0002,148,0002,113,536
6May 11, 2026 15:0392,668464,849,182451,937,0002,141,0002,113,536
7May 11, 2026 15:0393,789470,377,139457,428,0002,142,0002,113,536
8May 11, 2026 15:0394,087472,166,681458,794,0002,235,0002,113,536
9May 11, 2026 15:0394,105469,883,947458,947,0002,168,0002,113,536