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 28, 2026 08:19Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 08:20022,175,38202,270,000290,816Exit with code 1: prefix_v=1 stat=1 regular=1 size=1000000000 words=704 p=09d7f9f2,96b97d1e,d31f02f2,8947c9ec,b058a584,05ea4446,8d35aba7,5accf38a,aae075c4,bd2c0b9f,04ed589b,ccf81d42,961ea878,c12a7a61,295d996b,d1f0f424,4634a4a3,f235d7d4,5bd6faa6,310dfa1...stderr