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 listAug 25, 2026 05:17Victor MerckléVictor MerckléScore: 28,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 05:1728,307147,071,934136,552,0002,156,0002,117,632stderr
2Aug 25, 2026 05:1728,374147,401,741138,025,0001,011,0002,117,632stderr
3Aug 25, 2026 05:1728,495147,993,500137,620,0002,006,0002,117,632stderr
4Aug 25, 2026 05:1728,531148,213,111137,788,0002,015,0002,117,632stderr
5Aug 25, 2026 05:1728,546148,245,595137,869,0002,011,0002,117,632stderr
6Aug 25, 2026 05:1728,560148,320,774138,936,0001,012,0002,117,632stderr
7Aug 25, 2026 05:1728,571148,396,451137,986,0002,012,0002,117,632stderr
8Aug 25, 2026 05:1728,825149,673,757139,230,0002,015,0002,117,632stderr
9Aug 25, 2026 05:1728,961150,396,351139,862,0002,047,0002,117,632stderr