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 2, 2026 15:13Josu San MartinJosu San MartinScore: 30,413Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 15:1330,373159,635,518147,684,0001,144,0002,113,536
2Aug 2, 2026 15:1330,388159,680,877147,767,0001,138,0002,113,536
3Aug 2, 2026 15:1330,405159,806,643147,861,0001,128,0002,113,536
4Aug 2, 2026 15:1330,405159,754,907147,865,0001,123,0002,113,536
5Aug 2, 2026 15:1330,413159,746,316147,888,0001,140,0002,113,536
6Aug 2, 2026 15:1330,423159,797,656147,957,0001,116,0002,113,536
7Aug 2, 2026 15:1330,439159,897,630148,023,0001,129,0002,113,536
8Aug 2, 2026 15:1330,641160,303,117149,017,0001,128,0002,113,536
9Aug 2, 2026 15:1330,685161,065,626149,245,0001,116,0002,113,536