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 listMay 11, 2026 16:06Victor MerckléVictor MerckléScore: 85,360Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 16:0785,286426,751,596415,664,0002,240,0002,113,536
2May 11, 2026 16:0785,320428,731,359415,828,0002,241,0002,113,536
3May 11, 2026 16:0785,357429,196,203416,049,0002,202,0002,113,536
4May 11, 2026 16:0785,358427,150,416416,250,0002,006,0002,113,536
5May 11, 2026 16:0785,360427,014,338416,064,0002,203,0002,113,536
6May 11, 2026 16:0785,405427,755,140416,379,0002,106,0002,113,536
7May 11, 2026 16:0785,405427,290,839416,407,0002,079,0002,113,536
8May 11, 2026 16:0786,707434,594,364422,646,0002,222,0002,113,536
9May 11, 2026 16:0786,835437,405,972423,364,0002,128,0002,113,536