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:19Victor MerckléVictor MerckléScore: 26,146Success
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:2026,118136,404,483126,935,0001,044,0002,117,632stderr
2Sep 2, 2026 04:2026,134136,516,529126,970,0001,087,0002,117,632stderr
3Sep 2, 2026 04:2026,138136,478,319126,983,0001,095,0002,117,632stderr
4Sep 2, 2026 04:2026,144136,517,556127,011,0001,095,0002,117,632stderr
5Sep 2, 2026 04:2026,146136,496,163127,025,0001,093,0002,117,632stderr
6Sep 2, 2026 04:2026,153136,636,770127,007,0001,146,0002,117,632stderr
7Sep 2, 2026 04:2026,159137,195,326127,044,0001,137,0002,117,632stderr
8Sep 2, 2026 04:2026,173136,691,319127,141,0001,111,0002,117,632stderr
9Sep 2, 2026 04:2026,212145,162,639127,245,0001,196,0002,117,632stderr