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:08Andrew EpsteinAndrew EpsteinScore: 224,011Success
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:09223,9231,107,703,0461,096,110,0001,115,0002,117,632stderr
2Sep 24, 2026 16:09223,9391,107,792,7401,096,207,0001,096,0002,117,632stderr
3Sep 24, 2026 16:09223,9401,107,774,6911,096,188,0001,118,0002,117,632stderr
4Sep 24, 2026 16:09223,9411,107,746,7141,096,205,0001,107,0002,117,632stderr
5Sep 24, 2026 16:09224,0111,109,459,5931,096,540,0001,117,0002,117,632stderr
6Sep 24, 2026 16:09224,0171,108,185,6931,096,577,0001,111,0002,117,632stderr
7Sep 24, 2026 16:09224,0501,108,277,2401,096,727,0001,120,0002,117,632stderr
8Sep 24, 2026 16:09224,0641,108,524,3881,095,790,0002,125,0002,117,632stderr
9Sep 24, 2026 16:09231,6561,146,336,8081,133,996,0001,122,0002,117,632stderr