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 21, 2026 16:48A_ShamanA_ShamanScore: 182,927Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 16:48182,597904,185,473759,744,000134,984,0002,113,536
2Jun 21, 2026 16:48182,685904,969,936760,185,000134,976,0002,113,536
3Jun 21, 2026 16:48182,880905,561,652759,609,000136,504,0002,113,536
4Jun 21, 2026 16:48182,921905,740,276759,420,000136,896,0002,113,536
5Jun 21, 2026 16:48182,927906,055,793760,435,000135,908,0002,113,536
6Jun 21, 2026 16:48183,123906,690,893759,736,000137,568,0002,113,536
7Jun 21, 2026 16:48183,251909,038,948760,581,000137,349,0002,113,536
8Jun 21, 2026 16:48183,272907,380,421760,248,000137,789,0002,113,536
9Jun 21, 2026 16:48183,407908,426,378760,388,000138,311,0002,113,536