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 listMar 19, 2026 23:10olliecrowolliecrowScore: 115,644Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 23:10115,584599,791,915565,363,000998,0002,310,144
2Mar 19, 2026 23:10115,620592,152,224564,542,0001,998,0002,306,048
3Mar 19, 2026 23:10115,627592,964,528565,572,000999,0002,281,472
4Mar 19, 2026 23:10115,644598,542,435564,660,0001,998,0002,310,144
5Mar 19, 2026 23:10115,647594,246,377565,672,000999,0002,314,240
6Mar 19, 2026 23:10115,812592,483,644566,478,0001,000,0002,301,952