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 listSep 3, 2026 17:31Victor MerckléVictor MerckléScore: 26,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 17:3125,971135,441,506126,213,0001,048,0002,117,632stderr
2Sep 3, 2026 17:3126,003135,888,668126,374,0001,044,0002,117,632stderr
3Sep 3, 2026 17:3126,017135,922,630126,377,0001,107,0002,117,632stderr
4Sep 3, 2026 17:3126,018136,887,271126,396,0001,097,0002,117,632stderr
5Sep 3, 2026 17:3126,024137,313,670126,392,0001,129,0002,117,632stderr
6Sep 3, 2026 17:3126,025136,028,276126,392,0001,133,0002,117,632stderr
7Sep 3, 2026 17:3126,028136,334,161126,430,0001,112,0002,117,632stderr
8Sep 3, 2026 17:3126,040136,200,561126,407,0001,191,0002,117,632stderr
9Sep 3, 2026 17:3126,071136,230,548126,630,0001,119,0002,117,632stderr