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 15:10Josu San MartinJosu San MartinScore: 30,344Success
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 15:1130,323158,586,265147,468,0001,119,0002,113,536
2Aug 2, 2026 15:1130,324158,498,848147,490,0001,100,0002,113,536
3Aug 2, 2026 15:1130,325158,598,780147,485,0001,110,0002,113,536
4Aug 2, 2026 15:1130,333158,607,144147,517,0001,119,0002,113,536
5Aug 2, 2026 15:1130,344158,681,238147,568,0001,122,0002,113,536
6Aug 2, 2026 15:1130,360158,861,172147,647,0001,121,0002,113,536
7Aug 2, 2026 15:1130,553159,749,887148,581,0001,130,0002,113,536
8Aug 2, 2026 15:1130,688160,459,275149,255,0001,120,0002,113,536
9Aug 2, 2026 15:1133,933176,867,950165,156,0001,118,0002,113,536