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 26, 2026 09:33flavio87flavio87Score: 27,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 09:3427,451142,967,974133,406,0001,107,0002,113,536
2Aug 26, 2026 09:3427,458142,932,882133,520,0001,029,0002,113,536
3Aug 26, 2026 09:3427,465143,028,388133,461,0001,119,0002,113,536
4Aug 26, 2026 09:3427,467143,004,840133,495,0001,098,0002,113,536
5Aug 26, 2026 09:3427,470143,015,969133,454,0001,152,0002,113,536
6Aug 26, 2026 09:3427,481143,025,645133,569,0001,089,0002,113,536
7Aug 26, 2026 09:3427,483142,984,807133,561,0001,106,0002,113,536
8Aug 26, 2026 09:3427,484143,073,556133,561,0001,114,0002,113,536
9Aug 26, 2026 09:3430,064155,727,847146,300,0001,017,0002,113,536