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 3, 2026 17:19Josu San MartinJosu San MartinScore: 27,786Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 17:1927,713144,215,800134,544,0001,251,0002,113,536
2Aug 3, 2026 17:1927,725144,319,226134,851,0001,003,0002,113,536
3Aug 3, 2026 17:1927,746144,402,803134,688,0001,271,0002,113,536
4Aug 3, 2026 17:1927,765145,191,374134,793,0001,257,0002,113,536
5Aug 3, 2026 17:1927,786144,617,617134,893,0001,261,0002,113,536
6Aug 3, 2026 17:1927,803144,402,658135,218,0001,018,0002,113,536
7Aug 3, 2026 17:1927,841145,549,736135,159,0001,266,0002,113,536
8Aug 3, 2026 17:1927,927145,375,859135,572,0001,274,0002,113,536
9Aug 3, 2026 17:1928,000146,354,751136,153,0001,047,0002,113,536