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 7, 2026 15:56Victor MerckléVictor MerckléScore: 32,685Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 15:5732,330166,487,421157,407,0001,012,0002,117,632stderr
2Jul 7, 2026 15:5732,449166,845,495157,990,0001,011,0002,117,632stderr
3Jul 7, 2026 15:5732,551167,547,799158,493,0001,011,0002,117,632stderr
4Jul 7, 2026 15:5732,612168,023,775158,793,0001,010,0002,117,632stderr
5Jul 7, 2026 15:5732,685167,983,752159,152,0001,008,0002,117,632stderr
6Jul 7, 2026 15:5732,752168,290,272159,483,0001,005,0002,117,632stderr
7Jul 7, 2026 15:5732,828168,932,146159,850,0001,011,0002,117,632stderr
8Jul 7, 2026 15:5732,861168,909,798160,014,0001,008,0002,117,632stderr
9Jul 7, 2026 15:5732,911169,077,008160,256,0001,011,0002,117,632stderr