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 13:45Josu San MartinJosu San MartinScore: 25,464Success
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 13:4525,401136,932,881123,213,0001,255,0002,113,536
2Aug 4, 2026 13:4525,411133,621,751123,259,0001,258,0002,113,536
3Aug 4, 2026 13:4525,454133,814,125123,668,0001,060,0002,113,536
4Aug 4, 2026 13:4525,460133,035,294123,495,0001,259,0002,113,536
5Aug 4, 2026 13:4525,464133,453,238123,506,0001,270,0002,113,536
6Aug 4, 2026 13:4525,470135,895,928123,551,0001,255,0002,113,536
7Aug 4, 2026 13:4525,472133,235,608123,564,0001,251,0002,113,536
8Aug 4, 2026 13:4525,707135,094,658124,959,0001,008,0002,113,536
9Aug 4, 2026 13:4525,734134,382,650124,836,0001,261,0002,113,536