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 2, 2026 11:47Josu San MartinJosu San MartinScore: 31,969Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 11:4831,919167,226,125155,283,0001,121,0002,113,536
2Aug 2, 2026 11:4831,944166,547,092155,418,0001,109,0002,113,536
3Aug 2, 2026 11:4831,960167,335,068155,502,0001,106,0002,113,536
4Aug 2, 2026 11:4831,968167,398,548155,513,0001,131,0002,113,536
5Aug 2, 2026 11:4831,969167,383,382155,518,0001,132,0002,113,536
6Aug 2, 2026 11:4831,994166,815,245155,655,0001,118,0002,113,536
7Aug 2, 2026 11:4831,996167,554,590155,644,0001,138,0002,113,536
8Aug 2, 2026 11:4832,086168,501,781156,095,0001,129,0002,113,536
9Aug 2, 2026 11:4832,846171,028,583159,833,0001,117,0002,113,536