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 03:40Josu San MartinJosu San MartinScore: 27,370Success
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 03:4127,280142,447,653132,663,0001,011,0002,113,536
2Aug 4, 2026 03:4127,341142,347,011132,730,0001,244,0002,113,536
3Aug 4, 2026 03:4127,348142,486,213132,745,0001,261,0002,113,536
4Aug 4, 2026 03:4127,354143,104,787133,027,0001,010,0002,113,536
5Aug 4, 2026 03:4127,370142,614,192132,842,0001,271,0002,113,536
6Aug 4, 2026 03:4127,402142,732,008133,003,0001,267,0002,113,536
7Aug 4, 2026 03:4127,437142,596,199133,417,0001,026,0002,113,536
8Aug 4, 2026 03:4127,602143,760,255133,987,0001,266,0002,113,536
9Aug 4, 2026 03:4127,639143,812,019134,410,0001,022,0002,113,536