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 13:55Victor MerckléVictor MerckléScore: 95,694Success
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 13:5695,607477,230,862466,304,0002,172,0002,113,536
2May 11, 2026 13:5695,652479,522,926466,553,0002,144,0002,113,536
3May 11, 2026 13:5695,656479,618,184466,493,0002,223,0002,113,536
4May 11, 2026 13:5695,681480,166,942466,781,0002,057,0002,113,536
5May 11, 2026 13:5695,694478,404,796466,780,0002,122,0002,113,536
6May 11, 2026 13:5695,702479,330,221466,775,0002,167,0002,113,536
7May 11, 2026 13:5695,741479,721,711466,887,0002,244,0002,113,536
8May 11, 2026 13:5695,751478,272,354466,952,0002,228,0002,113,536
9May 11, 2026 13:5695,763478,242,088467,220,0002,021,0002,113,536