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 19, 2025 20:32Aniruddha DebAniruddha DebScore: 228,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2025 20:32228,4721,143,491,1811,118,515,000999,0002,531,328
2Aug 19, 2025 20:32228,6251,142,477,4061,118,263,0001,998,0002,433,024
3Aug 19, 2025 20:32231,7771,155,978,3731,133,710,0001,999,0002,428,928