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 13:32Kevin HeaveyKevin HeaveyScore: 58,338Success
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 13:5257,982294,033,360274,235,0009,880,0002,113,536
2Jul 27, 2026 13:5258,136294,753,517273,866,00011,002,0002,113,536
3Jul 27, 2026 13:5258,176294,991,906275,017,00010,048,00020,480
4Jul 27, 2026 13:5258,323295,723,220273,773,00012,012,00020,480
5Jul 27, 2026 13:5258,338295,713,992275,572,00010,289,00020,480
6Jul 27, 2026 13:5258,369296,003,995274,053,00011,956,00020,480
7Jul 27, 2026 13:5258,473296,409,925273,789,00012,731,00020,480
8Jul 27, 2026 13:5258,555296,730,820274,582,00012,340,0002,113,536
9Jul 27, 2026 13:5258,588297,042,101274,724,00012,359,0002,113,536