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:50Victor MerckléVictor MerckléScore: 26,115Success
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:5026,106136,321,847126,894,0001,026,0002,117,632stderr
2Sep 2, 2026 04:5026,109136,513,373126,834,0001,103,0002,117,632stderr
3Sep 2, 2026 04:5026,110136,382,162126,841,0001,099,0002,117,632stderr
4Sep 2, 2026 04:5026,111136,380,010126,836,0001,108,0002,117,632stderr
5Sep 2, 2026 04:5026,115136,613,827126,868,0001,096,0002,117,632stderr
6Sep 2, 2026 04:5026,122136,381,407126,906,0001,093,0002,117,632stderr
7Sep 2, 2026 04:5026,123136,488,748126,911,0001,096,0002,117,632stderr
8Sep 2, 2026 04:5026,135136,445,234126,930,0001,132,0002,117,632stderr
9Sep 2, 2026 04:5026,139136,656,226126,956,0001,129,0002,117,632stderr