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 03:44Victor MerckléVictor MerckléScore: 49,315Success
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 03:4549,256249,312,975239,337,0002,020,0002,117,632stderr
2Jul 4, 2026 03:4549,256249,317,533239,354,0002,004,0002,117,632stderr
3Jul 4, 2026 03:4549,262249,341,257239,372,0002,016,0002,117,632stderr
4Jul 4, 2026 03:4549,308249,733,069239,602,0002,008,0002,117,632stderr
5Jul 4, 2026 03:4549,315249,534,920239,629,0002,018,0002,117,632stderr
6Jul 4, 2026 03:4549,345249,695,988239,735,0002,060,0002,117,632stderr
7Jul 4, 2026 03:4549,357249,778,099239,826,0002,028,0002,117,632stderr
8Jul 4, 2026 03:4550,064253,270,034243,290,0002,028,0002,117,632stderr
9Jul 4, 2026 03:4550,944257,762,265247,581,0002,048,0002,117,632stderr