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:09Victor MerckléVictor MerckléScore: 27,826Success
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:1027,802144,654,908134,220,0002,013,0002,117,632stderr
2Aug 25, 2026 06:1027,812144,693,282135,272,0001,011,0002,117,632stderr
3Aug 25, 2026 06:1027,819144,705,033135,307,0001,009,0002,117,632stderr
4Aug 25, 2026 06:1027,822144,760,387134,310,0002,020,0002,117,632stderr
5Aug 25, 2026 06:1027,826145,305,263135,341,0001,009,0002,117,632stderr
6Aug 25, 2026 06:1027,835144,769,482134,369,0002,027,0002,117,632stderr
7Aug 25, 2026 06:1027,837145,447,856134,368,0002,035,0002,117,632stderr
8Aug 25, 2026 06:1027,846144,849,519134,394,0002,054,0002,117,632stderr
9Aug 25, 2026 06:1027,848144,883,029135,450,0001,009,0002,117,632stderr