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 15:17Josu San MartinJosu San MartinScore: 32,631Success
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 15:1832,608169,761,172158,666,0001,115,0002,113,536
2Aug 2, 2026 15:1832,612170,012,199158,681,0001,121,0002,113,536
3Aug 2, 2026 15:1832,620169,837,814158,723,0001,117,0002,113,536
4Aug 2, 2026 15:1832,628170,004,723158,751,0001,128,0002,113,536
5Aug 2, 2026 15:1832,631170,760,359158,768,0001,128,0002,113,536
6Aug 2, 2026 15:1832,642170,771,987158,814,0001,134,0002,113,536
7Aug 2, 2026 15:1832,653170,048,804158,876,0001,128,0002,113,536
8Aug 2, 2026 15:1832,833171,785,902159,743,0001,140,0002,113,536
9Aug 2, 2026 15:1833,141173,189,401161,263,0001,128,0002,113,536