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 24, 2026 20:55Victor MerckléVictor MerckléScore: 30,345Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 20:5630,210156,459,640147,024,0001,008,0002,117,632stderr
2Aug 24, 2026 20:5630,246156,624,566146,166,0002,040,0002,117,632stderr
3Aug 24, 2026 20:5630,270156,692,742147,314,0001,009,0002,117,632stderr
4Aug 24, 2026 20:5630,317156,925,340147,548,0001,010,0002,117,632stderr
5Aug 24, 2026 20:5630,345157,080,008146,656,0002,037,0002,117,632stderr
6Aug 24, 2026 20:5630,395157,323,333147,929,0001,010,0002,117,632stderr
7Aug 24, 2026 20:5630,430157,482,153147,097,0002,010,0002,117,632stderr
8Aug 24, 2026 20:5630,445157,524,117147,171,0002,011,0002,117,632stderr
9Aug 24, 2026 20:5630,463157,631,703148,262,0001,010,0002,117,632stderr