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 28, 2026 01:00Kevin HeaveyKevin HeaveyScore: 56,425Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2026 08:0556,151285,037,055266,227,0008,914,00020,480
2Jul 28, 2026 08:0556,208285,424,402266,365,0009,057,0002,113,536
3Jul 28, 2026 08:0556,241286,713,569266,517,0009,067,00020,480
4Jul 28, 2026 08:0556,383286,133,978266,402,0009,875,00020,480
5Jul 28, 2026 08:0556,425286,287,925266,228,00010,258,00020,480
6Jul 28, 2026 08:0556,484286,548,411266,229,00010,543,00020,480
7Jul 28, 2026 08:0556,633287,242,068266,380,00011,123,00020,480
8Jul 28, 2026 08:0556,717287,729,890265,852,00012,065,0002,113,536
9Jul 28, 2026 08:0556,757288,027,397266,031,00012,083,00020,480