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 06:22Josu San MartinJosu San MartinScore: 36,204Success
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 06:2336,175187,470,415176,141,0001,118,0002,113,536
2Aug 1, 2026 06:2336,194187,455,397176,247,0001,107,0002,113,536
3Aug 1, 2026 06:2336,195188,294,913176,230,0001,129,0002,113,536
4Aug 1, 2026 06:2336,199188,285,797176,242,0001,135,0002,113,536
5Aug 1, 2026 06:2336,204188,340,568176,270,0001,134,0002,113,536
6Aug 1, 2026 06:2336,210187,530,914176,295,0001,138,0002,113,536
7Aug 1, 2026 06:2336,211187,664,586176,308,0001,130,0002,113,536
8Aug 1, 2026 06:2336,215188,328,681176,333,0001,124,0002,113,536
9Aug 1, 2026 06:2336,240187,744,377176,266,0001,310,0002,113,536