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 25, 2026 04:53Victor MerckléVictor MerckléScore: 28,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 04:5428,555148,294,603138,911,0001,010,0002,117,632stderr
2Aug 25, 2026 04:5428,586148,458,181138,039,0002,035,0002,117,632stderr
3Aug 25, 2026 04:5428,601157,688,735139,137,0001,010,0002,117,632stderr
4Aug 25, 2026 04:5428,653148,812,304139,392,0001,010,0002,117,632stderr
5Aug 25, 2026 04:5428,670148,838,898138,439,0002,045,0002,117,632stderr
6Aug 25, 2026 04:5428,702149,004,301139,633,0001,010,0002,117,632stderr
7Aug 25, 2026 04:5428,800149,518,869139,099,0002,024,0002,117,632stderr
8Aug 25, 2026 04:5429,098159,946,504141,574,0001,009,0002,117,632stderr
9Aug 25, 2026 04:5431,418172,303,762140,703,00013,249,0002,117,632stderr