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 15:06Victor MerckléVictor MerckléScore: 92,553Success
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 15:0791,937459,459,670448,271,0002,221,0002,113,536
2May 11, 2026 15:0792,115461,982,083449,211,0002,157,0002,113,536
3May 11, 2026 15:0792,532464,453,323451,163,0002,244,0002,113,536
4May 11, 2026 15:0792,536465,161,430451,307,0002,124,0002,113,536
5May 11, 2026 15:0792,553464,099,033451,426,0002,085,0002,113,536
6May 11, 2026 15:0792,613462,785,855451,724,0002,082,0002,113,536
7May 11, 2026 15:0792,650465,998,586451,885,0002,101,0002,113,536
8May 11, 2026 15:0792,676462,899,609451,956,0002,161,0002,113,536
9May 11, 2026 15:0793,944470,242,360458,080,0002,249,0002,113,536