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:21anboto1anboto1Score: 57,669Success
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:2257,551290,352,471280,913,0001,091,0002,113,536
2Aug 3, 2026 20:2257,558290,511,915280,938,0001,101,0002,113,536
3Aug 3, 2026 20:2257,566290,529,834280,911,0001,163,0002,113,536
4Aug 3, 2026 20:2257,636290,837,216281,415,0001,002,0002,113,536
5Aug 3, 2026 20:2257,669291,034,120281,489,0001,091,0002,113,536
6Aug 3, 2026 20:2257,679292,874,400281,479,0001,151,0002,113,536
7Aug 3, 2026 20:2257,754292,018,377281,837,0001,160,0002,113,536
8Aug 3, 2026 20:2257,890291,862,421282,564,0001,100,0002,113,536
9Aug 3, 2026 20:2258,020293,116,716283,204,0001,096,0002,113,536