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 20:03Victor MerckléVictor MerckléScore: 31,894Success
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 20:0431,716165,231,432154,398,0001,012,0002,117,632stderr
2Jul 9, 2026 20:0431,766163,566,327153,614,0002,044,0002,117,632stderr
3Jul 9, 2026 20:0431,771163,859,058154,671,0001,011,0002,117,632stderr
4Jul 9, 2026 20:0431,882164,175,566154,206,0002,019,0002,117,632stderr
5Jul 9, 2026 20:0431,894164,208,954154,264,0002,018,0002,117,632stderr
6Jul 9, 2026 20:0431,964164,486,948154,608,0002,016,0002,117,632stderr
7Jul 9, 2026 20:0432,061165,190,081155,062,0002,037,0002,117,632stderr
8Jul 9, 2026 20:0432,153165,670,832155,538,0002,014,0002,117,632stderr
9Jul 9, 2026 20:0432,374166,509,157156,625,0002,010,0002,117,632stderr