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 23, 2026 14:36Kevin HeaveyKevin HeaveyScore: 34,065Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 14:3733,551174,792,295163,096,0001,307,00020,480
2Sep 23, 2026 14:3733,585174,996,968163,444,0001,123,00020,480
3Sep 23, 2026 14:3733,629175,888,476163,663,0001,122,00020,480
4Sep 23, 2026 14:3733,697175,551,124163,995,0001,124,00020,480
5Sep 23, 2026 14:3734,065177,246,428165,816,0001,104,00020,480
6Sep 23, 2026 14:3734,215177,993,184166,557,0001,101,00020,480
7Sep 23, 2026 14:3734,250178,634,190166,711,0001,116,00020,480
8Sep 23, 2026 14:3734,281178,448,806166,875,0001,106,00020,480
9Sep 23, 2026 14:3734,967181,753,697170,232,0001,111,00020,480