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 10:44Victor MerckléVictor MerckléScore: 59,628Success
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 10:4459,538299,635,738289,696,0002,044,0002,117,632stderr
2Jun 28, 2026 10:4459,548299,697,495289,681,0002,108,0002,117,632stderr
3Jun 28, 2026 10:4459,566299,760,962289,866,0002,009,0002,117,632stderr
4Jun 28, 2026 10:4459,586299,851,307289,917,0002,055,0002,117,632stderr
5Jun 28, 2026 10:4459,628300,079,242290,099,0002,080,0002,117,632stderr
6Jun 28, 2026 10:4459,693300,710,936290,415,0002,085,0002,117,632stderr
7Jun 28, 2026 10:4459,707300,430,692290,542,0002,027,0002,117,632stderr
8Jun 28, 2026 10:4459,765300,807,881290,679,0002,172,0002,117,632stderr
9Jun 28, 2026 10:4459,785300,842,411290,828,0002,120,0002,117,632stderr