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:15Victor MerckléVictor MerckléScore: 26,560Success
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:1626,524138,363,490128,947,0001,022,0002,117,632stderr
2Sep 3, 2026 17:1626,535138,485,323128,926,0001,097,0002,117,632stderr
3Sep 3, 2026 17:1626,539138,457,142128,936,0001,106,0002,117,632stderr
4Sep 3, 2026 17:1626,558138,591,451128,936,0001,203,0002,117,632stderr
5Sep 3, 2026 17:1626,560138,646,543128,997,0001,148,0002,117,632stderr
6Sep 3, 2026 17:1626,580139,184,580129,230,0001,012,0002,117,632stderr
7Sep 3, 2026 17:1626,583147,931,965129,117,0001,144,0002,117,632stderr
8Sep 3, 2026 17:1626,590145,049,751129,014,0001,281,0002,117,632stderr
9Sep 3, 2026 17:1626,713152,002,139129,766,0001,128,0002,117,632stderr