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 8, 2026 09:59Victor MerckléVictor MerckléScore: 31,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 10:0031,485162,456,043153,271,0001,010,0002,117,632stderr
2Jul 8, 2026 10:0031,495162,182,128153,319,0001,010,0002,117,632stderr
3Jul 8, 2026 10:0031,517162,284,694153,426,0001,011,0002,117,632stderr
4Jul 8, 2026 10:0031,540162,445,512152,542,0002,005,0002,117,632stderr
5Jul 8, 2026 10:0031,602162,910,980153,840,0001,012,0002,117,632stderr
6Jul 8, 2026 10:0031,702163,575,247154,330,0001,010,0002,117,632stderr
7Jul 8, 2026 10:0031,743165,317,568154,531,0001,011,0002,117,632stderr
8Jul 8, 2026 10:0031,753163,502,720154,584,0001,008,0002,117,632stderr
9Jul 8, 2026 10:0031,814164,053,910153,811,0002,080,0002,117,632stderr