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 8, 2026 14:42Victor MerckléVictor MerckléScore: 31,948Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 14:4231,735163,413,671154,496,0001,010,0002,117,632stderr
2Jul 8, 2026 14:4231,847163,933,488155,042,0001,013,0002,117,632stderr
3Jul 8, 2026 14:4231,883164,280,373155,219,0001,012,0002,117,632stderr
4Jul 8, 2026 14:4231,910164,210,628155,351,0001,011,0002,117,632stderr
5Jul 8, 2026 14:4231,948165,945,472154,537,0002,012,0002,117,632stderr
6Jul 8, 2026 14:4232,003164,885,982154,808,0002,011,0002,117,632stderr
7Jul 8, 2026 14:4232,102165,176,312156,293,0001,011,0002,117,632stderr
8Jul 8, 2026 14:4232,120165,221,972156,380,0001,011,0002,117,632stderr
9Jul 8, 2026 14:4232,755168,422,258159,489,0001,013,0002,117,632stderr