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:58Victor MerckléVictor MerckléScore: 71,673Success
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:5971,610360,228,080348,695,0002,195,0002,113,536
2May 11, 2026 16:5971,625361,573,572348,741,0002,222,0002,113,536
3May 11, 2026 16:5971,667359,967,797349,100,0002,070,0002,113,536
4May 11, 2026 16:5971,673360,119,013348,991,0002,210,0002,113,536
5May 11, 2026 16:5971,673361,918,258348,994,0002,208,0002,113,536
6May 11, 2026 16:5971,735361,734,455349,435,0002,068,0002,113,536
7May 11, 2026 16:5976,695384,572,118373,756,0002,050,0002,113,536
8May 11, 2026 16:5976,734387,397,190373,985,0002,012,0002,113,536
9May 11, 2026 16:5977,360390,773,215377,058,0002,009,0002,113,536