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 3, 2026 21:04anboto1anboto1Score: 58,615Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 21:0658,487295,619,236285,507,0001,082,0002,113,536
2Aug 3, 2026 21:0658,501294,901,110285,482,0001,173,0002,113,536
3Aug 3, 2026 21:0658,509301,624,188285,553,0001,143,0002,113,536
4Aug 3, 2026 21:0658,538295,847,991285,628,0001,213,0002,113,536
5Aug 3, 2026 21:0658,615295,633,326286,104,0001,112,0002,113,536
6Aug 3, 2026 21:0658,793297,130,024286,951,0001,136,0002,113,536
7Aug 3, 2026 21:0659,016297,664,219288,046,0001,133,0002,113,536
8Aug 3, 2026 21:0659,142298,947,897288,637,0001,162,0002,113,536
9Aug 3, 2026 21:0659,183299,029,520288,905,0001,094,0002,113,536