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 3, 2026 18:28Victor MerckléVictor MerckléScore: 25,634Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 18:2925,583133,778,890124,341,0001,018,0002,117,632stderr
2Sep 3, 2026 18:2925,614134,005,233124,481,0001,028,0002,117,632stderr
3Sep 3, 2026 18:2925,616133,942,166124,477,0001,043,0002,117,632stderr
4Sep 3, 2026 18:2925,629133,791,197124,479,0001,106,0002,117,632stderr
5Sep 3, 2026 18:2925,634134,054,608124,516,0001,094,0002,117,632stderr
6Sep 3, 2026 18:2925,635134,085,361124,511,0001,102,0002,117,632stderr
7Sep 3, 2026 18:2925,637134,041,787124,522,0001,100,0002,117,632stderr
8Sep 3, 2026 18:2925,643143,020,362124,540,0001,115,0002,117,632stderr
9Sep 3, 2026 18:2925,654135,363,855124,541,0001,164,0002,117,632stderr