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 10:15Kevin HeaveyKevin HeaveyScore: 132,626Success
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 10:16132,442658,909,240636,122,00012,846,00020,480
2Jul 27, 2026 10:16132,457658,954,278635,846,00013,198,00020,480
3Jul 27, 2026 10:16132,563659,507,836636,308,00013,253,0002,113,536
4Jul 27, 2026 10:16132,580659,621,732636,344,00013,299,0002,113,536
5Jul 27, 2026 10:16132,626659,752,562635,866,00014,004,00020,480
6Jul 27, 2026 10:16132,629660,286,961635,935,00013,950,00020,480
7Jul 27, 2026 10:16132,810660,842,540636,123,00014,646,00020,480
8Jul 27, 2026 10:16133,565664,322,442641,908,00012,562,00020,480
9Jul 27, 2026 10:16133,983666,503,962641,932,00014,585,00020,480