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 1, 2026 09:41Josu San MartinJosu San MartinScore: 38,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 09:4138,088196,644,823185,535,0001,101,0002,113,536
2Aug 1, 2026 09:4138,123196,862,451185,681,0001,122,0002,113,536
3Aug 1, 2026 09:4138,133196,874,571185,748,0001,105,0002,113,536
4Aug 1, 2026 09:4138,137197,690,983185,735,0001,137,0002,113,536
5Aug 1, 2026 09:4138,143197,749,439185,763,0001,139,0002,113,536
6Aug 1, 2026 09:4138,148197,762,969185,809,0001,121,0002,113,536
7Aug 1, 2026 09:4138,153197,894,451185,825,0001,127,0002,113,536
8Aug 1, 2026 09:4138,154197,100,912185,829,0001,126,0002,113,536
9Aug 1, 2026 09:4139,210202,244,697190,995,0001,136,0002,113,536