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 4, 2026 14:44Josu San MartinJosu San MartinScore: 25,365Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 14:4425,297132,996,759122,949,0001,007,0002,113,536
2Aug 4, 2026 14:4425,308134,388,838122,747,0001,264,0002,113,536
3Aug 4, 2026 14:4425,311132,444,334122,770,0001,254,0002,113,536
4Aug 4, 2026 14:4425,343132,682,627123,175,0001,007,0002,113,536
5Aug 4, 2026 14:4425,365132,650,880123,028,0001,261,0002,113,536
6Aug 4, 2026 14:4425,369133,259,561123,033,0001,276,0002,113,536
7Aug 4, 2026 14:4425,374133,316,388123,069,0001,266,0002,113,536
8Aug 4, 2026 14:4425,379133,213,922123,096,0001,262,0002,113,536
9Aug 4, 2026 14:4425,456133,825,573123,469,0001,268,0002,113,536