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 2, 2026 11:33Victor MerckléVictor MerckléScore: 25,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 11:3425,693135,019,109124,791,0001,105,0002,117,632stderr
2Sep 2, 2026 11:3425,712134,499,020124,880,0001,109,0002,117,632stderr
3Sep 2, 2026 11:3425,714134,233,351124,916,0001,087,0002,117,632stderr
4Sep 2, 2026 11:3425,718134,452,580124,933,0001,090,0002,117,632stderr
5Sep 2, 2026 11:3425,724135,153,795124,893,0001,158,0002,117,632stderr
6Sep 2, 2026 11:3425,724134,890,322124,931,0001,118,0002,117,632stderr
7Sep 2, 2026 11:3425,725134,435,012124,919,0001,137,0002,117,632stderr
8Sep 2, 2026 11:3425,727135,160,700124,953,0001,111,0002,117,632stderr
9Sep 2, 2026 11:3425,744134,624,533124,922,0001,227,0002,117,632stderr