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 12:08Kevin HeaveyKevin HeaveyScore: 59,492Success
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 12:2459,183299,979,827281,758,0008,241,00020,480
2Jul 27, 2026 12:2459,230300,274,873281,573,0008,654,00020,480
3Jul 27, 2026 12:2459,408301,825,488283,033,0008,068,00020,480
4Jul 27, 2026 12:2459,468301,768,648281,403,0009,991,00020,480
5Jul 27, 2026 12:2459,492302,165,460281,670,0009,842,00020,480
6Jul 27, 2026 12:2459,578302,107,114281,699,00010,238,00020,480
7Jul 27, 2026 12:2459,704302,634,872282,691,0009,863,00020,480
8Jul 27, 2026 12:2459,732302,748,884282,847,0009,842,00020,480
9Jul 27, 2026 12:2460,071314,083,296283,261,00011,087,0002,113,536