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 3, 2026 17:43Victor MerckléVictor MerckléScore: 51,323Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 17:4451,267259,534,413249,191,0002,019,0002,117,632stderr
2Jul 3, 2026 17:4451,267259,099,407250,203,0001,007,0002,117,632stderr
3Jul 3, 2026 17:4451,295259,330,539249,320,0002,030,0002,117,632stderr
4Jul 3, 2026 17:4451,316259,447,088249,408,0002,042,0002,117,632stderr
5Jul 3, 2026 17:4451,323259,420,841249,411,0002,075,0002,117,632stderr
6Jul 3, 2026 17:4451,331259,486,917249,512,0002,010,0002,117,632stderr
7Jul 3, 2026 17:4451,354259,555,606249,630,0002,008,0002,117,632stderr
8Jul 3, 2026 17:4451,396259,798,570249,806,0002,036,0002,117,632stderr
9Jul 3, 2026 17:4451,439260,611,420250,017,0002,037,0002,117,632stderr