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:08Kevin HeaveyKevin HeaveyScore: 51,425Success
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:3951,042260,259,049241,377,0008,731,0002,113,536
2Jul 27, 2026 14:3951,116260,625,914241,478,0008,991,00020,480
3Jul 27, 2026 14:3951,176263,207,038241,855,0008,909,00020,480
4Jul 27, 2026 14:3951,346261,654,957242,022,0009,576,00020,480
5Jul 27, 2026 14:3951,425262,067,293241,684,00010,303,00020,480
6Jul 27, 2026 14:3951,446262,246,471242,054,00010,033,0002,113,536
7Jul 27, 2026 14:3951,490262,420,220241,313,00010,988,0002,113,536
8Jul 27, 2026 14:3951,507263,655,595241,299,00011,089,00020,480
9Jul 27, 2026 14:3951,826264,169,847241,301,00012,649,00020,480