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 27, 2026 15:10Kevin HeaveyKevin HeaveyScore: 62,990Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 15:3962,868318,125,409306,762,0001,294,00020,480
2Jul 27, 2026 15:3962,951320,885,460306,904,0001,557,00020,480
3Jul 27, 2026 15:3962,958318,527,058306,841,0001,658,0002,113,536
4Jul 27, 2026 15:3962,960319,287,665306,852,0001,656,00020,480
5Jul 27, 2026 15:3962,990318,725,993307,105,0001,548,00020,480
6Jul 27, 2026 15:3962,999318,710,582307,043,0001,653,00020,480
7Jul 27, 2026 15:3963,007318,852,911306,076,0002,661,0002,113,536
8Jul 27, 2026 15:3963,011318,887,030307,230,0001,527,0002,113,536
9Jul 27, 2026 15:3963,037318,930,352307,213,0001,671,00020,480