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 04:52Victor MerckléVictor MerckléScore: 26,235Success
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 04:5226,227136,936,224127,427,0001,088,0002,117,632stderr
2Sep 2, 2026 04:5226,229136,928,650127,431,0001,095,0002,117,632stderr
3Sep 2, 2026 04:5226,231136,915,656127,441,0001,094,0002,117,632stderr
4Sep 2, 2026 04:5226,235136,995,617127,432,0001,123,0002,117,632stderr
5Sep 2, 2026 04:5226,235136,956,420127,446,0001,106,0002,117,632stderr
6Sep 2, 2026 04:5226,237136,890,099127,477,0001,085,0002,117,632stderr
7Sep 2, 2026 04:5226,237137,064,394127,471,0001,095,0002,117,632stderr
8Sep 2, 2026 04:5226,242136,961,757127,495,0001,093,0002,117,632stderr
9Sep 2, 2026 04:5226,246137,095,536127,482,0001,124,0002,117,632stderr