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 19:16Victor MerckléVictor MerckléScore: 28,606Success
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 19:1728,300147,049,005136,639,0002,032,0002,117,632stderr
2Aug 24, 2026 19:1728,414148,418,726137,216,0002,013,0002,117,632stderr
3Aug 24, 2026 19:1728,441147,491,875137,348,0002,013,0002,117,632stderr
4Aug 24, 2026 19:1728,483148,677,983137,562,0002,008,0002,117,632stderr
5Aug 24, 2026 19:1728,606148,949,791138,075,0002,095,0002,117,632stderr
6Aug 24, 2026 19:1728,695148,968,853138,587,0002,020,0002,117,632stderr
7Aug 24, 2026 19:1728,765149,283,621139,941,0001,010,0002,117,632stderr
8Aug 24, 2026 19:1728,807149,463,055140,147,0001,009,0002,117,632stderr
9Aug 24, 2026 19:1728,812149,310,557140,173,0001,009,0002,117,632stderr