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 24, 2026 16:11Andrew EpsteinAndrew EpsteinScore: 36,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 16:1236,867191,025,494179,547,0001,102,0002,113,536
2Sep 24, 2026 16:1236,876191,223,552179,586,0001,108,0002,113,536
3Sep 24, 2026 16:1236,884191,208,456179,623,0001,111,0002,113,536
4Sep 24, 2026 16:1236,885191,434,001179,626,0001,114,0002,113,536
5Sep 24, 2026 16:1236,892191,207,959179,670,0001,103,0002,113,536
6Sep 24, 2026 16:1236,895191,235,632179,662,0001,127,0002,113,536
7Sep 24, 2026 16:1236,904191,282,642179,722,0001,112,0002,113,536
8Sep 24, 2026 16:1236,908191,312,014179,707,0001,144,0002,113,536
9Sep 24, 2026 16:1236,914191,356,589179,754,0001,125,0002,113,536