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 20, 2026 01:28Victor MerckléVictor MerckléScore: 56,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 01:2956,688285,696,528275,706,0002,067,0002,113,536
2Jun 20, 2026 01:2956,689285,405,561275,752,0002,027,0002,113,536
3Jun 20, 2026 01:2956,693285,403,788275,616,0002,181,0002,113,536
4Jun 20, 2026 01:2956,752285,701,345275,850,0002,236,0002,113,536
5Jun 20, 2026 01:2956,772285,762,121276,128,0002,057,0002,113,536
6Jun 20, 2026 01:2956,794285,933,829276,188,0002,106,0002,113,536
7Jun 20, 2026 01:2956,832286,056,822276,431,0002,047,0002,113,536
8Jun 20, 2026 01:2956,861287,584,004276,563,0002,056,0002,113,536
9Jun 20, 2026 01:2956,936286,537,367276,952,0002,039,0002,113,536