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 05:40Victor MerckléVictor MerckléScore: 28,253Success
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 05:4128,130146,235,402135,780,0002,059,0002,117,632stderr
2Aug 25, 2026 05:4128,206146,661,449136,139,0002,072,0002,117,632stderr
3Aug 25, 2026 05:4128,243146,785,791136,341,0002,054,0002,117,632stderr
4Aug 25, 2026 05:4128,247146,811,661137,400,0001,011,0002,117,632stderr
5Aug 25, 2026 05:4128,253146,931,801136,351,0002,093,0002,117,632stderr
6Aug 25, 2026 05:4128,280146,922,332136,563,0002,013,0002,117,632stderr
7Aug 25, 2026 05:4128,284147,062,613136,486,0002,106,0002,117,632stderr
8Aug 25, 2026 05:4128,616148,696,702138,127,0002,095,0002,117,632stderr
9Aug 25, 2026 05:4128,787150,226,541138,917,0002,144,0002,117,632stderr