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 10:10Kevin HeaveyKevin HeaveyScore: 165,825Success
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 10:11164,644816,709,668791,797,00014,961,0002,113,536
2Jul 27, 2026 10:11164,680816,833,425792,592,00014,341,00020,480
3Jul 27, 2026 10:11164,694816,970,935792,923,00014,078,00020,480
4Jul 27, 2026 10:11165,002818,488,958793,151,00015,362,0002,113,536
5Jul 27, 2026 10:11165,825822,565,260794,299,00018,246,0002,113,536
6Jul 27, 2026 10:11165,967824,164,426796,325,00016,915,0002,113,536
7Jul 27, 2026 10:11166,037823,486,264798,998,00014,585,00020,480
8Jul 27, 2026 10:11166,467825,601,384801,485,00014,204,0002,113,536
9Jul 27, 2026 10:11166,801827,238,046801,951,00015,377,00020,480