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 29, 2026 01:44Josu San MartinJosu San MartinScore: 25,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 01:4525,367132,705,164123,038,0001,261,0002,113,536
2Aug 29, 2026 01:4525,507133,372,907123,726,0001,263,0002,113,536
3Aug 29, 2026 01:4525,519133,492,353123,780,0001,265,0002,113,536
4Aug 29, 2026 01:4525,562133,707,771124,005,0001,253,0002,113,536
5Aug 29, 2026 01:4525,565134,215,658124,013,0001,256,0002,113,536
6Aug 29, 2026 01:4525,567133,659,358124,021,0001,260,0002,113,536
7Aug 29, 2026 01:4525,570133,708,993124,045,0001,252,0002,113,536
8Aug 29, 2026 01:4525,573133,748,484124,055,0001,255,0002,113,536
9Aug 29, 2026 01:4525,843134,980,709125,630,0001,004,0002,113,536