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:31Victor MerckléVictor MerckléScore: 28,107Success
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:3127,976145,504,722136,076,0001,009,0002,117,632stderr
2Aug 25, 2026 04:3127,985145,583,619135,109,0002,018,0002,117,632stderr
3Aug 25, 2026 04:3127,991145,589,641135,124,0002,033,0002,117,632stderr
4Aug 25, 2026 04:3128,089146,076,043135,635,0002,004,0002,117,632stderr
5Aug 25, 2026 04:3128,107146,171,596136,717,0001,010,0002,117,632stderr
6Aug 25, 2026 04:3128,145147,676,578135,888,0002,023,0002,117,632stderr
7Aug 25, 2026 04:3128,297147,028,263136,638,0002,020,0002,117,632stderr
8Aug 25, 2026 04:3128,342147,308,452137,871,0001,009,0002,117,632stderr
9Aug 25, 2026 04:3128,361147,315,429136,964,0002,007,0002,117,632stderr