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 11:51Kevin HeaveyKevin HeaveyScore: 74,906Success
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 11:5474,136373,303,890352,780,00010,491,0002,113,536
2Jul 27, 2026 11:5474,210373,491,827352,637,00010,996,00020,480
3Jul 27, 2026 11:5474,706375,914,989353,259,00012,801,0002,113,536
4Jul 27, 2026 11:5474,723376,141,485353,428,00012,715,0002,113,536
5Jul 27, 2026 11:5474,906376,952,252353,290,00013,751,00020,480
6Jul 27, 2026 11:5475,497379,753,341355,766,00014,173,00020,480
7Jul 27, 2026 11:5475,531379,995,874353,619,00016,483,00020,480
8Jul 27, 2026 11:5475,940381,994,480353,806,00018,301,00020,480
9Jul 27, 2026 11:5475,981382,250,418353,654,00018,656,00020,480