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:48Kevin HeaveyKevin HeaveyScore: 91,038Success
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:5090,213451,975,512429,295,00012,749,00020,480
2Jul 27, 2026 11:5090,541453,535,798430,260,00013,394,0002,113,536
3Jul 27, 2026 11:5090,997456,123,027429,504,00016,384,00020,480
4Jul 27, 2026 11:5091,000455,894,881429,524,00016,380,00020,480
5Jul 27, 2026 11:5091,038455,904,324429,423,00016,665,00020,480
6Jul 27, 2026 11:5091,123456,354,591429,675,00016,828,0002,113,536
7Jul 27, 2026 11:5091,442457,923,483430,395,00017,674,0002,113,536
8Jul 27, 2026 11:5091,761459,529,876430,405,00019,227,00020,480
9Jul 27, 2026 11:5092,329462,228,539430,466,00021,948,0002,113,536