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 22, 2026 12:00flavio87flavio87Score: 31,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2026 12:0131,913164,608,677155,276,0001,098,0002,113,536
2Aug 22, 2026 12:0131,933164,836,516155,453,0001,023,0002,113,536
3Aug 22, 2026 12:0131,935164,770,625155,391,0001,094,0002,113,536
4Aug 22, 2026 12:0131,946165,404,725155,400,0001,140,0002,113,536
5Aug 22, 2026 12:0131,950164,866,778155,438,0001,120,0002,113,536
6Aug 22, 2026 12:0131,953165,000,209155,467,0001,106,0002,113,536
7Aug 22, 2026 12:0131,959164,887,347155,501,0001,101,0002,113,536
8Aug 22, 2026 12:0131,979165,728,705155,554,0001,146,0002,113,536
9Aug 22, 2026 12:0135,895184,260,297174,789,0001,100,0002,113,536