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 14:23Kevin HeaveyKevin HeaveyScore: 66,412Success
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 14:5566,003333,455,359314,753,0008,663,00020,480
2Jul 27, 2026 14:5566,054333,743,985314,716,0008,950,00020,480
3Jul 27, 2026 14:5566,059333,784,023314,942,0008,749,00020,480
4Jul 27, 2026 14:5566,298334,971,633314,906,0009,955,00020,480
5Jul 27, 2026 14:5566,412337,822,787314,735,00010,685,00020,480
6Jul 27, 2026 14:5566,496335,920,621314,617,00011,214,00020,480
7Jul 27, 2026 14:5566,626336,544,347314,702,00011,766,00020,480
8Jul 27, 2026 14:5566,649336,744,824314,718,00011,864,0002,113,536
9Jul 27, 2026 14:5566,818337,519,159315,467,00011,942,0002,113,536