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 16:20Josu San MartinJosu San MartinScore: 29,808Success
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 16:2029,795156,167,151144,877,0001,119,0002,113,536
2Aug 2, 2026 16:2029,797156,775,932144,880,0001,130,0002,113,536
3Aug 2, 2026 16:2029,803156,901,679144,904,0001,134,0002,113,536
4Aug 2, 2026 16:2029,804156,432,209144,919,0001,125,0002,113,536
5Aug 2, 2026 16:2029,808156,194,242144,950,0001,113,0002,113,536
6Aug 2, 2026 16:2029,811156,856,077144,950,0001,125,0002,113,536
7Aug 2, 2026 16:2029,822156,819,945145,006,0001,124,0002,113,536
8Aug 2, 2026 16:2029,832156,288,839145,045,0001,133,0002,113,536
9Aug 2, 2026 16:2029,849156,333,228145,128,0001,134,0002,113,536