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 12:28Kevin HeaveyKevin HeaveyScore: 58,091Success
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 12:3557,748293,108,529274,164,0008,803,00020,480
2Jul 27, 2026 12:3557,804293,352,660274,531,0008,712,00020,480
3Jul 27, 2026 12:3557,818293,301,935274,293,0009,018,00020,480
4Jul 27, 2026 12:3558,090294,643,445274,241,00010,402,00020,480
5Jul 27, 2026 12:3558,091294,769,976274,345,00010,301,00020,480
6Jul 27, 2026 12:3558,173295,065,944274,459,00010,592,00020,480
7Jul 27, 2026 12:3558,202295,251,328274,577,00010,615,00020,480
8Jul 27, 2026 12:3558,231297,327,316274,524,00010,808,00020,480
9Jul 27, 2026 12:3558,594297,119,154276,793,00010,321,00020,480