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:04Victor MerckléVictor MerckléScore: 28,182Success
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:0528,155146,420,376136,951,0001,009,0002,117,632stderr
2Aug 25, 2026 06:0528,162146,450,120135,982,0002,014,0002,117,632stderr
3Aug 25, 2026 06:0528,171148,796,769136,018,0002,023,0002,117,632stderr
4Aug 25, 2026 06:0528,179146,506,278136,058,0002,021,0002,117,632stderr
5Aug 25, 2026 06:0528,182146,630,209136,070,0002,023,0002,117,632stderr
6Aug 25, 2026 06:0528,203147,272,962137,186,0001,010,0002,117,632stderr
7Aug 25, 2026 06:0528,214146,627,415136,221,0002,029,0002,117,632stderr
8Aug 25, 2026 06:0528,215146,759,979136,245,0002,013,0002,117,632stderr
9Aug 25, 2026 06:0528,222146,692,317136,266,0002,025,0002,117,632stderr