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 28, 2026 11:34Victor MerckléVictor MerckléScore: 52,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 11:3552,571265,843,710255,510,0002,091,0002,113,536
2Jun 28, 2026 11:3552,589265,874,881255,556,0002,131,0002,113,536
3Jun 28, 2026 11:3552,617265,750,650255,664,0002,161,0002,113,536
4Jun 28, 2026 11:3552,618265,706,632255,679,0002,152,0002,113,536
5Jun 28, 2026 11:3552,639265,833,568255,924,0002,011,0002,113,536
6Jun 28, 2026 11:3552,648266,223,426255,848,0002,129,0002,113,536
7Jun 28, 2026 11:3552,801266,604,271256,709,0002,019,0002,113,536
8Jun 28, 2026 11:3552,814266,725,373256,674,0002,119,0002,113,536
9Jun 28, 2026 11:3552,853266,889,285256,820,0002,164,0002,113,536