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 12:25Kevin HeaveyKevin HeaveyScore: 54,986Success
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 12:3354,643277,762,918259,141,0008,611,00020,480
2Jul 27, 2026 12:3354,712278,178,781259,293,0008,800,00020,480
3Jul 27, 2026 12:3354,717278,167,287259,193,0008,922,0002,113,536
4Jul 27, 2026 12:3354,842278,758,618258,652,00010,075,00020,480
5Jul 27, 2026 12:3354,986279,430,685258,941,00010,491,0002,113,536
6Jul 27, 2026 12:3355,033280,209,766259,394,00010,270,00020,480
7Jul 27, 2026 12:3355,039281,585,812259,119,00010,573,00020,480
8Jul 27, 2026 12:3355,054279,816,927259,035,00010,733,0002,113,536
9Jul 27, 2026 12:3355,133280,245,091259,456,00010,696,0002,113,536