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:00Kevin HeaveyKevin HeaveyScore: 51,926Success
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 14:2151,544263,746,389242,869,0009,698,00020,480
2Jul 27, 2026 14:2151,552263,769,880242,348,00010,259,00020,480
3Jul 27, 2026 14:2151,590263,024,604242,621,00010,170,00020,480
4Jul 27, 2026 14:2151,826264,056,043242,385,00011,563,00020,480
5Jul 27, 2026 14:2151,926264,521,926242,272,00012,168,00020,480
6Jul 27, 2026 14:2152,038265,044,246242,887,00012,103,00020,480
7Jul 27, 2026 14:2152,042265,870,533242,330,00012,677,00020,480
8Jul 27, 2026 14:2152,083265,260,179242,352,00012,855,0002,113,536
9Jul 27, 2026 14:2152,106265,430,179242,418,00012,906,0002,113,536