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:21Kevin HeaveyKevin HeaveyScore: 87,913Success
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:2386,516433,782,667409,022,00014,907,0002,113,536
2Jul 27, 2026 11:2386,967436,080,465406,155,00019,985,00020,480
3Jul 27, 2026 11:2386,999437,529,174406,204,00020,094,00024,576
4Jul 27, 2026 11:2387,165437,074,629406,504,00020,605,00020,480
5Jul 27, 2026 11:2387,913440,594,600407,166,00023,610,00020,480
6Jul 27, 2026 11:2388,007441,057,194416,962,00014,275,00020,480
7Jul 27, 2026 11:2388,015441,125,252416,868,00014,407,00020,480
8Jul 27, 2026 11:2388,116441,565,123407,037,00024,736,00024,576
9Jul 27, 2026 11:2388,376442,970,746407,225,00025,819,00020,480