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 4, 2026 15:08Victor MerckléVictor MerckléScore: 50,995Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 15:0850,607255,940,087245,954,0002,021,0002,117,632stderr
2Jul 4, 2026 15:0850,665256,227,092246,221,0002,038,0002,117,632stderr
3Jul 4, 2026 15:0850,707256,411,966246,456,0002,012,0002,117,632stderr
4Jul 4, 2026 15:0850,933257,578,111247,532,0002,043,0002,117,632stderr
5Jul 4, 2026 15:0850,995257,879,680247,821,0002,057,0002,117,632stderr
6Jul 4, 2026 15:0851,059258,019,289248,123,0002,068,0002,117,632stderr
7Jul 4, 2026 15:0851,297259,341,261249,308,0002,051,0002,117,632stderr
8Jul 4, 2026 15:0851,370259,634,446249,695,0002,021,0002,117,632stderr
9Jul 4, 2026 15:0851,752261,558,772251,574,0002,011,0002,117,632stderr