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 15, 2025 15:42zielajzielajScore: 39,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 15:4237,544206,039,354180,966,0002,999,0002,318,336
2Jul 15, 2025 15:4237,571207,065,811183,097,0001,000,0002,441,216
3Jul 15, 2025 15:4237,796207,042,595184,197,0001,001,0002,453,504
4Jul 15, 2025 15:4238,210208,311,162187,229,00002,310,144
5Jul 15, 2025 15:4239,690220,413,459194,483,00002,453,504
6Jul 15, 2025 15:4239,862221,518,207194,322,0001,001,0002,322,432
7Jul 15, 2025 15:4239,991224,158,344192,958,0002,999,0002,461,696
8Jul 15, 2025 15:4248,146259,084,637234,914,000999,0002,314,240
9Jul 15, 2025 15:4255,228294,817,624268,620,0001,997,0002,306,048