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 05:42Josu San MartinJosu San MartinScore: 31,330Success
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 05:4331,212161,953,094151,933,0001,007,0002,113,536
2Aug 3, 2026 05:4331,309162,554,236152,148,0001,270,0002,113,536
3Aug 3, 2026 05:4331,310161,978,386152,151,0001,269,0002,113,536
4Aug 3, 2026 05:4331,318161,862,341152,199,0001,264,0002,113,536
5Aug 3, 2026 05:4331,330161,954,577152,258,0001,262,0002,113,536
6Aug 3, 2026 05:4331,338162,224,149152,296,0001,264,0002,113,536
7Aug 3, 2026 05:4331,348162,118,198152,341,0001,265,0002,113,536
8Aug 3, 2026 05:4331,353163,305,282152,365,0001,268,0002,113,536
9Aug 3, 2026 05:4333,257172,042,001161,962,0001,002,0002,113,536