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 listJul 10, 2026 18:22Genos0Genos0Score: 2,170,999Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 18:232,098,65633,447,892,1995,983,947,0004,299,470,0002,121,728
2Jul 10, 2026 18:232,170,99928,127,911,5876,040,616,0004,597,283,0002,129,920
3Jul 10, 2026 18:232,179,23127,668,219,8986,029,723,0004,648,509,0002,117,632