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 17:16Victor MerckléVictor MerckléScore: 30,197Success
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 17:1629,954154,993,537145,766,0001,010,0002,117,632stderr
2Aug 24, 2026 17:1629,959155,149,516145,792,0001,008,0002,117,632stderr
3Aug 24, 2026 17:1630,118156,713,514146,567,0001,012,0002,117,632stderr
4Aug 24, 2026 17:1630,174156,297,058146,846,0001,009,0002,117,632stderr
5Aug 24, 2026 17:1630,197156,502,536146,960,0001,008,0002,117,632stderr
6Aug 24, 2026 17:1630,199156,413,600146,967,0001,009,0002,117,632stderr
7Aug 24, 2026 17:1630,211156,215,386147,028,0001,009,0002,117,632stderr
8Aug 24, 2026 17:1630,270156,637,395147,315,0001,009,0002,117,632stderr
9Aug 24, 2026 17:1630,300156,634,327147,461,0001,009,0002,117,632stderr