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 14, 2026 04:38Victor MerckléVictor MerckléScore: 29,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 04:3829,294151,643,877141,528,0002,013,0002,117,632stderr
2Jul 14, 2026 04:3829,322151,741,600141,638,0002,041,0002,117,632stderr
3Jul 14, 2026 04:3829,346151,655,410141,707,0002,089,0002,117,632stderr
4Jul 14, 2026 04:3829,415152,206,159142,089,0002,045,0002,117,632stderr
5Jul 14, 2026 04:3829,430152,063,351142,119,0002,092,0002,117,632stderr
6Jul 14, 2026 04:3829,434152,391,026142,200,0002,029,0002,117,632stderr
7Jul 14, 2026 04:3829,549152,730,760142,764,0002,027,0002,117,632stderr
8Jul 14, 2026 04:3829,566152,758,642142,845,0002,030,0002,117,632stderr
9Jul 14, 2026 04:3829,624153,252,598143,112,0002,047,0002,117,632stderr