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 listNov 11, 2025 01:23izotoffizotoffScore: 698,463Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2025 01:23698,2983,445,105,7593,420,662,000999,0002,326,528
2Nov 11, 2025 01:23698,4023,447,334,0413,420,173,0001,998,0002,326,528
3Nov 11, 2025 01:23698,4333,446,750,2773,420,323,0001,999,0002,326,528
4Nov 11, 2025 01:23698,4603,447,360,8663,419,458,0002,998,0002,326,528
5Nov 11, 2025 01:23698,4633,454,121,1023,420,470,0001,999,0002,326,528
6Nov 11, 2025 01:23698,5483,452,103,5883,417,890,0004,996,0002,322,432
7Nov 11, 2025 01:23698,7473,452,098,6683,419,865,0003,997,0002,326,528
8Nov 11, 2025 01:23698,8113,456,088,5193,423,174,000999,0002,326,528
9Nov 11, 2025 01:23698,8313,458,323,0653,419,274,0004,997,0002,318,336