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 listJul 13, 2025 01:04zielajzielajScore: 41,799Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2025 01:0441,780228,588,960203,726,000998,0002,306,048
2Jul 13, 2025 01:0441,781228,459,413202,732,0001,997,0002,457,600
3Jul 13, 2025 01:0441,790227,488,282200,776,0003,995,0002,326,528
4Jul 13, 2025 01:0441,791225,637,394203,776,000998,0002,420,736
5Jul 13, 2025 01:0441,799228,785,266203,815,000999,0002,310,144
6Jul 13, 2025 01:0441,813231,158,703202,885,0001,998,0002,445,312
7Jul 13, 2025 01:0442,005230,153,455204,825,000999,0002,445,312
8Jul 13, 2025 01:0442,056234,577,636203,075,0003,001,0002,461,696
9Jul 13, 2025 01:0442,078229,605,412205,181,0001,000,0002,318,336