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 listJul 4, 2026 12:53Victor MerckléVictor MerckléScore: 47,776Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 12:5347,090238,787,065228,728,0002,017,0002,117,632stderr
2Jul 4, 2026 12:5347,125238,914,982228,903,0002,011,0002,117,632stderr
3Jul 4, 2026 12:5347,166239,069,466229,061,0002,057,0002,117,632stderr
4Jul 4, 2026 12:5347,283239,630,812229,652,0002,036,0002,117,632stderr
5Jul 4, 2026 12:5347,776242,047,012232,099,0002,007,0002,117,632stderr
6Jul 4, 2026 12:5347,783242,192,293232,116,0002,025,0002,117,632stderr
7Jul 4, 2026 12:5347,828242,365,363232,346,0002,014,0002,117,632stderr
8Jul 4, 2026 12:5347,890242,587,175232,619,0002,044,0002,117,632stderr
9Jul 4, 2026 12:5350,080253,339,294243,372,0002,022,0002,117,632stderr