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 listJun 8, 2026 10:23Victor MerckléVictor MerckléScore: 51,329Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 10:2451,305260,648,027249,129,0002,270,0002,113,536
2Jun 8, 2026 10:2451,309260,545,153249,351,0002,065,0002,113,536
3Jun 8, 2026 10:2451,318260,583,254249,398,0002,064,0002,113,536
4Jun 8, 2026 10:2451,320260,663,791249,447,0002,022,0002,113,536
5Jun 8, 2026 10:2451,329260,654,522249,432,0002,081,0002,113,536
6Jun 8, 2026 10:2451,356260,748,784249,570,0002,076,0002,113,536
7Jun 8, 2026 10:2451,412260,998,931249,857,0002,062,0002,113,536
8Jun 8, 2026 10:2451,415261,133,460249,755,0002,179,0002,113,536
9Jun 8, 2026 10:2451,922263,652,738252,332,0002,088,0002,113,536