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 04:53Josu San MartinJosu San MartinScore: 31,149Success
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 04:5431,004160,324,592150,674,0001,248,0002,113,536
2Aug 4, 2026 04:5431,005160,326,391150,894,0001,033,0002,113,536
3Aug 4, 2026 04:5431,027160,498,325150,783,0001,253,0002,113,536
4Aug 4, 2026 04:5431,138162,262,961151,326,0001,253,0002,113,536
5Aug 4, 2026 04:5431,149161,024,992151,359,0001,272,0002,113,536
6Aug 4, 2026 04:5431,234161,469,319152,035,0001,014,0002,113,536
7Aug 4, 2026 04:5431,572163,185,861153,438,0001,266,0002,113,536
8Aug 4, 2026 04:5432,432167,395,693157,652,0001,268,0002,113,536
9Aug 4, 2026 04:5433,111170,644,456160,995,0001,249,0002,113,536