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 24, 2026 17:11Victor MerckléVictor MerckléScore: 31,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 17:1231,279161,452,452152,261,0001,010,0002,117,632stderr
2Aug 24, 2026 17:1231,557163,191,447152,469,0002,164,0002,117,632stderr
3Aug 24, 2026 17:1231,608163,241,097153,872,0001,009,0002,117,632stderr
4Aug 24, 2026 17:1231,661163,352,180154,132,0001,010,0002,117,632stderr
5Aug 24, 2026 17:1231,662163,333,061154,134,0001,011,0002,117,632stderr
6Aug 24, 2026 17:1231,728163,966,346154,459,0001,012,0002,117,632stderr
7Aug 24, 2026 17:1231,738165,132,987154,507,0001,010,0002,117,632stderr
8Aug 24, 2026 17:1231,811164,050,501153,858,0002,016,0002,117,632stderr
9Aug 24, 2026 17:1232,053165,479,989156,050,0001,012,0002,117,632stderr