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 16:12Victor MerckléVictor MerckléScore: 29,856Success
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 16:1229,611153,462,861144,087,0001,008,0002,117,632stderr
2Aug 24, 2026 16:1229,792154,429,828143,959,0002,023,0002,117,632stderr
3Aug 24, 2026 16:1229,834154,549,188144,180,0002,011,0002,117,632stderr
4Aug 24, 2026 16:1229,837154,566,303145,194,0001,009,0002,117,632stderr
5Aug 24, 2026 16:1229,856154,517,117145,288,0001,009,0002,117,632stderr
6Aug 24, 2026 16:1229,874154,811,830145,372,0001,012,0002,117,632stderr
7Aug 24, 2026 16:1229,924154,847,887145,620,0001,011,0002,117,632stderr
8Aug 24, 2026 16:1229,956155,178,064145,776,0001,009,0002,117,632stderr
9Aug 24, 2026 16:1230,224156,431,300147,089,0001,010,0002,117,632stderr