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 3, 2026 05:11Josu San MartinJosu San MartinScore: 32,249Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 05:1232,224166,284,885156,647,0001,252,0002,113,536
2Aug 3, 2026 05:1232,230166,399,012156,665,0001,265,0002,113,536
3Aug 3, 2026 05:1232,235166,913,285156,688,0001,265,0002,113,536
4Aug 3, 2026 05:1232,238167,131,237156,711,0001,258,0002,113,536
5Aug 3, 2026 05:1232,249166,157,516156,757,0001,265,0002,113,536
6Aug 3, 2026 05:1232,260167,149,061156,810,0001,266,0002,113,536
7Aug 3, 2026 05:1232,276166,344,901157,112,0001,042,0002,113,536
8Aug 3, 2026 05:1232,911169,731,670159,999,0001,265,0002,113,536
9Aug 3, 2026 05:1232,929169,695,667160,089,0001,265,0002,113,536