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 listJun 26, 2026 19:26A_ShamanA_ShamanScore: 136,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 19:26136,447677,903,152666,439,0002,155,0002,113,536
2Jun 26, 2026 19:26136,457678,153,692666,427,0002,215,0002,113,536
3Jun 26, 2026 19:26136,465678,469,542666,444,0002,239,0002,113,536
4Jun 26, 2026 19:26136,504678,255,226666,656,0002,217,0002,113,536
5Jun 26, 2026 19:26136,551678,808,745666,946,0002,154,0002,113,536
6Jun 26, 2026 19:26136,559679,078,574666,920,0002,223,0002,113,536
7Jun 26, 2026 19:26136,561678,399,239667,120,0002,029,0002,113,536
8Jun 26, 2026 19:26136,591678,760,968667,210,0002,088,0002,113,536
9Jun 26, 2026 19:26136,592678,674,943667,233,0002,069,0002,113,536