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 5, 2026 21:54Victor MerckléVictor MerckléScore: 58,104Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 21:5458,061293,588,968282,366,0002,135,0002,113,536
2Jun 5, 2026 21:5458,065293,630,405282,346,0002,177,0002,113,536
3Jun 5, 2026 21:5458,072293,723,283282,462,0002,092,0002,113,536
4Jun 5, 2026 21:5458,075293,887,014282,516,0002,052,0002,113,536
5Jun 5, 2026 21:5458,104293,892,534282,563,0002,149,0002,113,536
6Jun 5, 2026 21:5458,112293,896,410282,571,0002,180,0002,113,536
7Jun 5, 2026 21:5458,220294,405,250283,117,0002,162,0002,113,536
8Jun 5, 2026 21:5458,340295,007,047283,820,0002,047,0002,113,536
9Jun 5, 2026 21:5458,512295,791,119284,643,0002,067,0002,113,536