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 08:39Victor MerckléVictor MerckléScore: 26,120Success
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 08:4026,110136,339,395126,855,0001,087,0002,117,632stderr
2Sep 2, 2026 08:4026,111136,317,221126,928,0001,019,0002,117,632stderr
3Sep 2, 2026 08:4026,115136,499,054126,856,0001,109,0002,117,632stderr
4Sep 2, 2026 08:4026,118136,416,843126,882,0001,100,0002,117,632stderr
5Sep 2, 2026 08:4026,120137,126,650126,866,0001,125,0002,117,632stderr
6Sep 2, 2026 08:4026,123136,478,390126,907,0001,096,0002,117,632stderr
7Sep 2, 2026 08:4026,124137,142,009126,920,0001,092,0002,117,632stderr
8Sep 2, 2026 08:4026,125138,438,949126,902,0001,113,0002,117,632stderr
9Sep 2, 2026 08:4026,169136,640,710127,211,0001,020,0002,117,632stderr