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 00:08Victor MerckléVictor MerckléScore: 29,077Success
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 00:0828,968150,345,769140,936,0001,010,0002,117,632stderr
2Aug 25, 2026 00:0829,012151,251,749140,131,0002,028,0002,117,632stderr
3Aug 25, 2026 00:0829,038150,649,808141,279,0001,010,0002,117,632stderr
4Aug 25, 2026 00:0829,050150,725,081140,295,0002,052,0002,117,632stderr
5Aug 25, 2026 00:0829,077150,880,740140,461,0002,020,0002,117,632stderr
6Aug 25, 2026 00:0829,098151,006,727140,561,0002,023,0002,117,632stderr
7Aug 25, 2026 00:0829,159151,291,815141,872,0001,009,0002,117,632stderr
8Aug 25, 2026 00:0829,171151,368,814140,907,0002,033,0002,117,632stderr
9Aug 25, 2026 00:0829,278152,068,365141,451,0002,014,0002,117,632stderr