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 12:54Victor MerckléVictor MerckléScore: 100,507Success
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 12:55100,054499,764,937489,047,0001,218,0002,113,536
2May 11, 2026 12:55100,174501,431,334489,673,0001,182,0002,113,536
3May 11, 2026 12:55100,215501,729,104489,834,0001,223,0002,113,536
4May 11, 2026 12:55100,252500,968,439490,032,0001,205,0002,113,536
5May 11, 2026 12:55100,507501,189,936491,317,0001,168,0002,113,536
6May 11, 2026 12:55100,507503,010,909491,475,0001,010,0002,113,536
7May 11, 2026 12:55100,511503,446,419491,343,0001,164,0002,113,536
8May 11, 2026 12:55100,555503,920,002491,546,0001,174,0002,113,536
9May 11, 2026 12:55100,603503,724,865491,801,0001,154,0002,113,536