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 9, 2026 23:59Victor MerckléVictor MerckléScore: 29,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 00:0029,718153,441,330144,612,0001,008,0002,117,632stderr
2Jul 10, 2026 00:0029,720153,493,658144,619,0001,009,0002,117,632stderr
3Jul 10, 2026 00:0029,734153,772,472144,692,0001,009,0002,117,632stderr
4Jul 10, 2026 00:0029,754153,980,799144,789,0001,009,0002,117,632stderr
5Jul 10, 2026 00:0029,765153,713,407144,843,0001,009,0002,117,632stderr
6Jul 10, 2026 00:0029,833154,016,382144,165,0002,017,0002,117,632stderr
7Jul 10, 2026 00:0029,836154,140,177144,179,0002,018,0002,117,632stderr
8Jul 10, 2026 00:0030,034155,253,991145,151,0002,016,0002,117,632stderr
9Jul 10, 2026 00:0030,104155,451,533145,501,0002,009,0002,117,632stderr