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 listSep 2, 2026 01:32Victor MerckléVictor MerckléScore: 27,653Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 01:3227,543143,458,175133,937,0001,025,0002,117,632stderr
2Sep 2, 2026 01:3227,548143,372,381133,944,0001,043,0002,117,632stderr
3Sep 2, 2026 01:3227,646143,989,662134,354,0001,113,0002,117,632stderr
4Sep 2, 2026 01:3227,651145,090,679134,393,0001,097,0002,117,632stderr
5Sep 2, 2026 01:3227,653144,189,526134,399,0001,101,0002,117,632stderr
6Sep 2, 2026 01:3227,662144,480,421134,458,0001,089,0002,117,632stderr
7Sep 2, 2026 01:3227,669143,988,336134,482,0001,098,0002,117,632stderr
8Sep 2, 2026 01:3227,671144,020,720134,492,0001,097,0002,117,632stderr
9Sep 2, 2026 01:3227,677143,887,314134,464,0001,156,0002,117,632stderr