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:18Victor MerckléVictor MerckléScore: 27,819Success
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:1927,775144,793,366135,091,0001,010,0002,117,632stderr
2Aug 25, 2026 08:1927,794144,626,169134,156,0002,038,0002,117,632stderr
3Aug 25, 2026 08:1927,795144,581,389134,189,0002,007,0002,117,632stderr
4Aug 25, 2026 08:1927,801144,702,181134,190,0002,039,0002,117,632stderr
5Aug 25, 2026 08:1927,819144,671,671135,307,0001,009,0002,117,632stderr
6Aug 25, 2026 08:1927,824144,722,723134,304,0002,035,0002,117,632stderr
7Aug 25, 2026 08:1927,835144,729,259135,383,0001,011,0002,117,632stderr
8Aug 25, 2026 08:1927,842145,494,839134,407,0002,023,0002,117,632stderr
9Aug 25, 2026 08:1927,851144,857,130134,433,0002,041,0002,117,632stderr