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 28, 2026 00:08Kevin HeaveyKevin HeaveyScore: 60,355Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2026 00:1059,985303,973,110242,966,00050,964,00020,480
2Jul 28, 2026 00:1060,073304,387,649243,534,00050,827,00020,480
3Jul 28, 2026 00:1060,110304,548,581242,529,00052,012,00020,480
4Jul 28, 2026 00:1060,289305,423,401243,071,00052,346,0002,113,536
5Jul 28, 2026 00:1060,355305,792,910243,370,00052,370,0002,113,536
6Jul 28, 2026 00:1060,518306,602,899243,121,00053,422,0002,113,536
7Jul 28, 2026 00:1061,008309,672,134243,849,00055,095,0002,113,536
8Jul 28, 2026 00:1061,031309,087,285242,441,00056,614,0002,113,536
9Jul 28, 2026 00:1061,621311,947,307246,946,00055,001,0002,113,536