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 20:52anboto1anboto1Score: 69,237Success
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 20:5569,190348,086,961337,946,0001,089,0002,113,536
2Aug 3, 2026 20:5569,193347,485,640337,958,0001,088,0002,113,536
3Aug 3, 2026 20:5569,198347,507,875337,990,0001,083,0002,113,536
4Aug 3, 2026 20:5569,213348,184,524338,050,0001,096,0002,113,536
5Aug 3, 2026 20:5569,237347,574,452338,066,0001,200,0002,113,536
6Aug 3, 2026 20:5569,347348,919,501338,638,0001,163,0002,113,536
7Aug 3, 2026 20:5569,390348,448,088338,924,0001,088,0002,113,536
8Aug 3, 2026 20:5569,650349,737,462340,121,0001,165,0002,113,536
9Aug 3, 2026 20:5569,887350,674,858341,343,0001,104,0002,113,536