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:46Victor MerckléVictor MerckléScore: 72,880Success
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:4772,734365,293,147354,314,0002,087,0002,113,536
2May 11, 2026 16:4772,800368,292,148354,637,0002,085,0002,113,536
3May 11, 2026 16:4772,805365,587,324354,552,0002,194,0002,113,536
4May 11, 2026 16:4772,832368,477,754354,803,0002,078,0002,113,536
5May 11, 2026 16:4772,880366,128,988355,009,0002,103,0002,113,536
6May 11, 2026 16:4772,931366,920,440355,194,0002,172,0002,113,536
7May 11, 2026 16:4772,954366,939,719355,386,0002,090,0002,113,536
8May 11, 2026 16:4772,971369,204,696355,550,0002,008,0002,113,536
9May 11, 2026 16:4778,247392,869,022381,397,0002,014,0002,113,536