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:29Kevin HeaveyKevin HeaveyScore: 66,345Success
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:1066,039343,519,890314,692,0008,903,0002,113,536
2Jul 27, 2026 15:1066,170334,217,187315,364,0008,873,0002,113,536
3Jul 27, 2026 15:1066,192335,131,751315,415,0008,928,00020,480
4Jul 27, 2026 15:1066,335335,111,631314,411,00010,633,00020,480
5Jul 27, 2026 15:1066,345346,002,892314,978,00010,116,0002,113,536
6Jul 27, 2026 15:1066,446335,745,120314,455,00011,132,0002,113,536
7Jul 27, 2026 15:1066,459335,710,810315,024,00010,626,00020,480
8Jul 27, 2026 15:1066,518336,100,681314,467,00011,475,0002,113,536
9Jul 27, 2026 15:1066,537336,046,512314,450,00011,584,0002,113,536