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 1, 2026 12:14Victor MerckléVictor MerckléScore: 51,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 12:1551,256260,473,397249,143,0002,013,0002,117,632stderr
2Jul 1, 2026 12:1551,262259,125,185248,992,0002,195,0002,117,632stderr
3Jul 1, 2026 12:1551,295259,320,682249,327,0002,020,0002,117,632stderr
4Jul 1, 2026 12:1551,339259,546,724249,535,0002,030,0002,117,632stderr
5Jul 1, 2026 12:1551,364259,581,704249,570,0002,118,0002,117,632stderr
6Jul 1, 2026 12:1551,365259,657,215249,506,0002,185,0002,117,632stderr
7Jul 1, 2026 12:1551,441260,013,450249,878,0002,186,0002,117,632stderr
8Jul 1, 2026 12:1551,485260,223,561250,253,0002,025,0002,117,632stderr
9Jul 1, 2026 12:1551,750261,623,567251,384,0002,192,0002,117,632stderr