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 27, 2026 14:30Kevin HeaveyKevin HeaveyScore: 66,594Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 15:1666,102334,088,692314,628,0009,272,00020,480
2Jul 27, 2026 15:1666,202334,492,229315,373,0009,017,0002,113,536
3Jul 27, 2026 15:1666,222334,533,346315,183,0009,307,00020,480
4Jul 27, 2026 15:1666,565336,218,986314,273,00011,899,0002,113,536
5Jul 27, 2026 15:1666,594337,183,268314,686,00011,628,00020,480
6Jul 27, 2026 15:1666,675336,693,496315,206,00011,506,0002,113,536
7Jul 27, 2026 15:1666,774337,371,907314,615,00012,582,00020,480
8Jul 27, 2026 15:1666,902338,059,566316,113,00011,711,0002,113,536
9Jul 27, 2026 15:1668,083343,690,146323,400,00010,209,00020,480