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 15:44Kevin HeaveyKevin HeaveyScore: 62,073Success
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 15:4560,736307,628,451296,066,0001,543,00020,480
2Jul 27, 2026 15:4561,578311,896,316299,159,0002,576,0002,113,536
3Jul 27, 2026 15:4561,664312,158,593300,487,0001,667,0002,113,536
4Jul 27, 2026 15:4561,893313,432,277301,850,0001,427,00020,480
5Jul 27, 2026 15:4562,073314,333,866302,619,0001,541,0002,113,536
6Jul 27, 2026 15:4562,231314,979,571303,385,0001,547,00020,480
7Jul 27, 2026 15:4562,246315,417,421303,476,0001,534,00020,480
8Jul 27, 2026 15:4562,272315,232,386303,479,0001,657,00020,480
9Jul 27, 2026 15:4562,389316,540,713304,133,0001,574,0002,113,536