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 19:38Josu San MartinJosu San MartinScore: 25,252Success
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 19:3925,159132,388,424122,031,0001,252,0002,113,536
2Aug 4, 2026 19:3925,165132,387,073122,063,0001,247,0002,113,536
3Aug 4, 2026 19:3925,167132,317,222122,068,0001,254,0002,113,536
4Aug 4, 2026 19:3925,185132,592,629122,135,0001,272,0002,113,536
5Aug 4, 2026 19:3925,252132,778,651122,471,0001,264,0002,113,536
6Aug 4, 2026 19:3925,284132,886,346122,639,0001,256,0002,113,536
7Aug 4, 2026 19:3925,287132,364,818122,650,0001,257,0002,113,536
8Aug 4, 2026 19:3925,432133,705,141123,341,0001,278,0002,113,536
9Aug 4, 2026 19:3926,325137,397,157127,748,0001,247,0002,113,536