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 04:43Victor MerckléVictor MerckléScore: 29,466Success
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 04:4329,337152,150,997142,741,0001,012,0002,117,632stderr
2Aug 25, 2026 04:4329,376152,354,083142,938,0001,009,0002,117,632stderr
3Aug 25, 2026 04:4329,378152,395,056142,946,0001,008,0002,117,632stderr
4Aug 25, 2026 04:4329,447152,699,538143,283,0001,009,0002,117,632stderr
5Aug 25, 2026 04:4329,466152,752,967143,377,0001,009,0002,117,632stderr
6Aug 25, 2026 04:4329,467152,798,704143,385,0001,008,0002,117,632stderr
7Aug 25, 2026 04:4329,570153,331,094143,884,0001,009,0002,117,632stderr
8Aug 25, 2026 04:4329,631153,605,271144,182,0001,010,0002,117,632stderr
9Aug 25, 2026 04:4331,346161,943,751152,589,0001,009,0002,117,632stderr