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 25, 2026 00:34Andrew EpsteinAndrew EpsteinScore: 32,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 00:3532,013167,315,772155,752,0001,115,0002,113,536
2Sep 25, 2026 00:3532,021167,348,833155,785,0001,119,0002,113,536
3Sep 25, 2026 00:3532,025167,417,169155,799,0001,125,0002,113,536
4Sep 25, 2026 00:3532,029167,335,022155,821,0001,125,0002,113,536
5Sep 25, 2026 00:3532,030167,444,873155,818,0001,132,0002,113,536
6Sep 25, 2026 00:3532,039167,487,216155,888,0001,107,0002,113,536
7Sep 25, 2026 00:3532,043167,331,468155,806,0001,205,0002,113,536
8Sep 25, 2026 00:3532,050168,205,670155,920,0001,125,0002,113,536
9Sep 25, 2026 00:3532,052168,715,956155,934,0001,123,0002,113,536