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 21:22Victor MerckléVictor MerckléScore: 31,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 21:2331,282161,133,131152,274,0001,008,0002,117,632stderr
2Jul 9, 2026 21:2331,539162,445,769153,535,0001,010,0002,117,632stderr
3Jul 9, 2026 21:2331,576162,890,851153,718,0001,008,0002,117,632stderr
4Jul 9, 2026 21:2331,600162,736,362153,831,0001,011,0002,117,632stderr
5Jul 9, 2026 21:2331,639162,899,048154,022,0001,010,0002,117,632stderr
6Jul 9, 2026 21:2331,746163,878,909154,546,0001,010,0002,117,632stderr
7Jul 9, 2026 21:2331,761163,771,894154,617,0001,013,0002,117,632stderr
8Jul 9, 2026 21:2331,870164,140,543155,154,0001,011,0002,117,632stderr
9Jul 9, 2026 21:2332,017164,786,770155,873,0001,012,0002,117,632stderr