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 00:45zielajzielajScore: 42,625Success
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 00:4542,213233,509,699204,844,0001,998,0002,457,600
2Jul 13, 2025 00:4542,344230,110,585205,493,0001,995,0002,453,504
3Jul 13, 2025 00:4542,363228,126,061206,583,000997,0002,322,432
4Jul 13, 2025 00:4542,369231,711,502204,614,0002,994,0002,326,528
5Jul 13, 2025 00:4542,625231,822,574207,865,000999,0002,322,432
6Jul 13, 2025 00:4542,723239,087,147209,344,00002,310,144
7Jul 13, 2025 00:4543,319231,639,629212,264,00002,453,504
8Jul 13, 2025 00:4543,320232,752,294209,263,0003,003,0002,330,624
9Jul 13, 2025 00:4548,446262,165,036236,385,0001,001,0002,445,312