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 6, 2026 13:24Victor MerckléVictor MerckléScore: 36,066Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 13:3035,797183,429,012174,403,0001,006,0002,117,632stderr
2Jul 6, 2026 13:3035,950183,954,518175,152,0001,005,0002,117,632stderr
3Jul 6, 2026 13:3036,033184,572,110175,559,0001,007,0002,117,632stderr
4Jul 6, 2026 13:3036,043184,668,061175,605,0001,007,0002,117,632stderr
5Jul 6, 2026 13:3036,066185,055,638175,719,0001,006,0002,117,632stderr
6Jul 6, 2026 13:3036,073184,530,342175,754,0001,006,0002,117,632stderr
7Jul 6, 2026 13:3036,196186,188,403175,191,0002,171,0002,117,632stderr
8Jul 6, 2026 13:3036,206185,420,787176,404,0001,006,0002,117,632stderr
9Jul 6, 2026 13:3036,219185,181,256176,468,0001,006,0002,117,632stderr