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 20, 2026 16:01M-RochatM-RochatScore: 110,969Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 16:02110,473552,800,390540,193,0001,125,0002,113,536
2May 20, 2026 16:02110,477552,486,674540,203,0001,135,0002,113,536
3May 20, 2026 16:02110,489553,033,272540,276,0001,121,0002,113,536
4May 20, 2026 16:02110,524550,954,987540,438,0001,134,0002,113,536
5May 20, 2026 16:02110,969555,363,518542,619,0001,130,0002,113,536
6May 20, 2026 16:02110,984555,805,801542,698,0001,125,0002,113,536
7May 20, 2026 16:02112,214560,290,054548,721,0001,129,0002,113,536
8May 20, 2026 16:02114,226572,137,431558,589,0001,123,0002,113,536
9May 20, 2026 16:02133,434664,460,363652,701,0001,129,0002,113,536