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 13:44Josu San MartinJosu San MartinScore: 31,874Success
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 13:4531,810166,627,338154,756,0001,116,0002,113,536
2Aug 2, 2026 13:4531,812166,663,674154,745,0001,137,0002,113,536
3Aug 2, 2026 13:4531,834166,752,206154,873,0001,115,0002,113,536
4Aug 2, 2026 13:4531,871166,133,968155,038,0001,132,0002,113,536
5Aug 2, 2026 13:4531,874166,282,172155,064,0001,123,0002,113,536
6Aug 2, 2026 13:4531,887166,380,482155,121,0001,126,0002,113,536
7Aug 2, 2026 13:4531,964166,746,076155,487,0001,137,0002,113,536
8Aug 2, 2026 13:4531,990167,457,098155,639,0001,116,0002,113,536
9Aug 2, 2026 13:4532,034167,754,689155,843,0001,125,0002,113,536