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 listOct 12, 2026 09:04Sandeep Raj KannaSandeep Raj KannaScore: 2,133,391Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 09:052,079,60426,497,069,9105,902,491,0004,287,569,0002,113,536
2Oct 12, 2026 09:052,133,39125,470,800,8775,973,291,0004,480,325,0002,146,304
3Oct 12, 2026 09:052,179,25027,459,686,7675,964,162,0004,714,163,0002,158,592