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:02Kevin HeaveyKevin HeaveyScore: 52,685Success
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:2852,372266,793,908248,359,0008,267,00020,480
2Jul 27, 2026 14:2852,393266,712,796248,339,0008,389,00020,480
3Jul 27, 2026 14:2852,418268,108,249248,442,0008,410,00020,480
4Jul 27, 2026 14:2852,572267,700,360248,523,0009,084,00020,480
5Jul 27, 2026 14:2852,685268,261,474248,257,0009,904,00020,480
6Jul 27, 2026 14:2852,780268,795,694249,167,0009,456,0002,113,536
7Jul 27, 2026 14:2852,859269,362,475248,345,00010,665,0002,113,536
8Jul 27, 2026 14:2852,968269,666,393248,345,00011,201,00020,480
9Jul 27, 2026 14:2852,987269,780,148248,391,00011,250,00020,480