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 21:56Josu San MartinJosu San MartinScore: 29,692Success
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 21:5629,635155,301,760144,107,0001,108,0002,113,536
2Aug 2, 2026 21:5629,656156,103,453144,183,0001,133,0002,113,536
3Aug 2, 2026 21:5629,665155,379,036144,234,0001,126,0002,113,536
4Aug 2, 2026 21:5629,680156,178,432144,289,0001,146,0002,113,536
5Aug 2, 2026 21:5629,692155,638,601144,362,0001,132,0002,113,536
6Aug 2, 2026 21:5629,711155,594,167144,459,0001,127,0002,113,536
7Aug 2, 2026 21:5629,712155,588,955144,484,0001,105,0002,113,536
8Aug 2, 2026 21:5631,916167,685,797155,240,0001,149,0002,113,536
9Aug 2, 2026 21:5632,808176,337,273159,607,0001,155,0002,113,536