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 listAug 3, 2026 20:16anboto1anboto1Score: 57,681Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 20:1757,548290,465,771280,922,0001,064,0002,113,536
2Aug 3, 2026 20:1757,583291,113,047280,967,0001,194,0002,113,536
3Aug 3, 2026 20:1757,593290,751,305280,986,0001,223,0002,113,536
4Aug 3, 2026 20:1757,615290,718,694281,143,0001,173,0002,113,536
5Aug 3, 2026 20:1757,681291,701,148281,523,0001,114,0002,113,536
6Aug 3, 2026 20:1757,736291,336,808281,798,0001,112,0002,113,536
7Aug 3, 2026 20:1757,754291,510,064281,872,0001,126,0002,113,536
8Aug 3, 2026 20:1757,760292,136,990281,869,0001,157,0002,113,536
9Aug 3, 2026 20:1757,785291,416,739281,945,0001,202,0002,113,536