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 14:56Josu San MartinJosu San MartinScore: 30,574Success
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 14:5730,566160,510,039148,648,0001,127,0002,113,536
2Aug 2, 2026 14:5730,566160,513,851148,638,0001,137,0002,113,536
3Aug 2, 2026 14:5730,567161,356,080148,662,0001,121,0002,113,536
4Aug 2, 2026 14:5730,573159,720,808148,707,0001,101,0002,113,536
5Aug 2, 2026 14:5730,574160,455,446148,687,0001,129,0002,113,536
6Aug 2, 2026 14:5730,600160,147,571148,819,0001,122,0002,113,536
7Aug 2, 2026 14:5730,601159,980,624148,823,0001,122,0002,113,536
8Aug 2, 2026 14:5730,781162,337,951149,712,0001,118,0002,113,536
9Aug 2, 2026 14:5730,865161,207,830150,128,0001,111,0002,113,536