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 listNov 6, 2025 13:43izotoffizotoffScore: 2,533,199Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2025 13:432,530,17212,435,252,12212,236,990,000160,855,0002,465,792
2Nov 6, 2025 13:432,533,19912,449,573,99112,270,795,000141,882,0002,453,504
3Nov 6, 2025 13:432,535,70812,460,084,39612,276,077,000148,891,0002,482,176