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 listAug 24, 2026 20:52Victor MerckléVictor MerckléScore: 42,824Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 20:5242,416216,181,989206,833,0001,006,0002,117,632stderr
2Aug 24, 2026 20:5242,627217,288,511207,870,0001,005,0002,117,632stderr
3Aug 24, 2026 20:5242,662217,468,804208,041,0001,006,0002,117,632stderr
4Aug 24, 2026 20:5242,734217,767,808208,393,0001,006,0002,117,632stderr
5Aug 24, 2026 20:5242,824218,222,917208,834,0001,005,0002,117,632stderr
6Aug 24, 2026 20:5242,841218,402,278208,916,0001,006,0002,117,632stderr
7Aug 24, 2026 20:5242,878218,482,688209,097,0001,006,0002,117,632stderr
8Aug 24, 2026 20:5242,986219,033,611209,626,0001,007,0002,117,632stderr
9Aug 24, 2026 20:5242,989219,021,162209,644,0001,006,0002,117,632stderr