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 06:51Victor MerckléVictor MerckléScore: 27,841Success
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 06:5227,814144,650,806135,281,0001,009,0002,117,632stderr
2Aug 25, 2026 06:5227,823144,727,781135,326,0001,009,0002,117,632stderr
3Aug 25, 2026 06:5227,826144,740,398134,325,0002,025,0002,117,632stderr
4Aug 25, 2026 06:5227,827144,800,291135,346,0001,010,0002,117,632stderr
5Aug 25, 2026 06:5227,841144,759,964134,416,0002,008,0002,117,632stderr
6Aug 25, 2026 06:5227,841144,857,024134,417,0002,005,0002,117,632stderr
7Aug 25, 2026 06:5227,855145,055,378135,480,0001,011,0002,117,632stderr
8Aug 25, 2026 06:5227,881145,000,280134,558,0002,059,0002,117,632stderr
9Aug 25, 2026 06:5227,904145,115,343135,721,0001,010,0002,117,632stderr