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 listJul 27, 2026 14:25Kevin HeaveyKevin HeaveyScore: 67,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 15:0666,973338,329,942320,637,0007,532,00020,480
2Jul 27, 2026 15:0666,978338,243,787320,874,0007,321,00020,480
3Jul 27, 2026 15:0667,029338,611,510320,680,0007,766,00020,480
4Jul 27, 2026 15:0667,268339,697,219321,244,0008,370,00020,480
5Jul 27, 2026 15:0667,455340,558,503322,166,0008,365,0002,113,536
6Jul 27, 2026 15:0667,474340,702,824321,912,0008,715,00020,480
7Jul 27, 2026 15:0667,487340,841,683321,120,0009,567,00020,480
8Jul 27, 2026 15:0667,572341,236,706320,913,00010,194,0002,113,536
9Jul 27, 2026 15:0668,003343,318,925322,024,00011,195,00020,480