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 15:45Victor MerckléVictor MerckléScore: 27,459Success
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 15:4627,417142,709,269133,327,0001,019,0002,117,632stderr
2Aug 25, 2026 15:4627,433142,808,801133,328,0001,096,0002,117,632stderr
3Aug 25, 2026 15:4627,456144,076,494133,448,0001,091,0002,117,632stderr
4Aug 25, 2026 15:4627,458142,929,398133,456,0001,091,0002,117,632stderr
5Aug 25, 2026 15:4627,459143,604,845133,446,0001,106,0002,117,632stderr
6Aug 25, 2026 15:4627,462143,003,281133,460,0001,107,0002,117,632stderr
7Aug 25, 2026 15:4627,478143,136,292133,542,0001,102,0002,117,632stderr
8Aug 25, 2026 15:4627,505144,234,990133,684,0001,091,0002,117,632stderr
9Aug 25, 2026 15:4627,509143,154,883133,704,0001,093,0002,117,632stderr