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 listApr 20, 2026 23:57Taylor DettlingTaylor DettlingScore: 250,120Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 23:57250,0001,250,584,4501,224,001,000999,0002,310,144
2Apr 20, 2026 23:57250,1201,252,301,4421,223,592,0001,999,0002,289,664
3Apr 20, 2026 23:57253,0781,269,440,3101,238,088,0001,998,0002,293,760