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 08:51Victor MerckléVictor MerckléScore: 27,354Success
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 08:5227,293142,101,799132,726,0001,012,0002,117,632stderr
2Aug 25, 2026 08:5227,300142,177,510132,740,0001,032,0002,117,632stderr
3Aug 25, 2026 08:5227,314142,224,657132,808,0001,032,0002,117,632stderr
4Aug 25, 2026 08:5227,335142,369,977132,852,0001,092,0002,117,632stderr
5Aug 25, 2026 08:5227,354142,487,149132,957,0001,082,0002,117,632stderr
6Aug 25, 2026 08:5227,370142,602,417132,985,0001,129,0002,117,632stderr
7Aug 25, 2026 08:5227,374142,506,423133,036,0001,098,0002,117,632stderr
8Aug 25, 2026 08:5227,385142,614,658133,096,0001,094,0002,117,632stderr
9Aug 25, 2026 08:5227,427142,781,731133,179,0001,218,0002,117,632stderr