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:23anboto1anboto1Score: 61,573Success
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:2460,948307,127,405297,553,0001,097,0002,113,536
2Aug 3, 2026 20:2460,960307,200,903297,617,0001,089,0002,113,536
3Aug 3, 2026 20:2461,129308,567,475298,447,0001,086,0002,113,536
4Aug 3, 2026 20:2461,142307,869,829298,420,0001,176,0002,113,536
5Aug 3, 2026 20:2461,573310,135,051300,678,0001,030,0002,113,536
6Aug 3, 2026 20:2461,616310,344,798300,730,0001,189,0002,113,536
7Aug 3, 2026 20:2467,928341,342,744331,714,0001,134,0002,113,536
8Aug 3, 2026 20:2469,143347,953,214337,656,0001,146,0002,113,536
9Aug 3, 2026 20:2471,520359,629,530349,279,0001,171,0002,113,536