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 15:47Victor MerckléVictor MerckléScore: 29,381Success
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 15:4829,291151,892,148142,440,0001,086,0002,117,632stderr
2Aug 25, 2026 15:4829,303151,996,492142,540,0001,047,0002,117,632stderr
3Aug 25, 2026 15:4829,358152,274,865142,765,0001,094,0002,117,632stderr
4Aug 25, 2026 15:4829,374152,278,483142,785,0001,149,0002,117,632stderr
5Aug 25, 2026 15:4829,381152,396,199142,939,0001,032,0002,117,632stderr
6Aug 25, 2026 15:4829,387152,363,192142,914,0001,085,0002,117,632stderr
7Aug 25, 2026 15:4829,402152,447,782142,978,0001,095,0002,117,632stderr
8Aug 25, 2026 15:4829,459152,761,477143,221,0001,130,0002,117,632stderr
9Aug 25, 2026 15:4829,460152,725,253143,264,0001,094,0002,117,632stderr