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:50Kevin HeaveyKevin HeaveyScore: 65,457Success
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:3064,824327,717,857308,905,0008,736,00020,480
2Jul 27, 2026 15:3065,052328,796,240309,826,0008,930,0002,113,536
3Jul 27, 2026 15:3065,078329,696,837309,054,0009,833,0002,113,536
4Jul 27, 2026 15:3065,380331,135,699309,046,00011,319,00020,480
5Jul 27, 2026 15:3065,457331,030,968309,850,00010,894,0002,113,536
6Jul 27, 2026 15:3065,509331,064,033308,888,00012,110,00020,480
7Jul 27, 2026 15:3065,557332,064,303309,926,00011,308,0002,113,536
8Jul 27, 2026 15:3065,677331,839,476309,727,00012,094,0002,113,536
9Jul 27, 2026 15:3066,098333,964,637312,862,00011,019,00020,480