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 29, 2026 06:04Kevin HeaveyKevin HeaveyScore: 55,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 06:0450,480257,427,612226,560,00020,795,00020,480
2Jul 29, 2026 06:0450,541257,936,332226,824,00020,830,00020,480
3Jul 29, 2026 06:0450,553258,560,151226,381,00021,331,00020,480
4Jul 29, 2026 06:0455,741283,305,803226,837,00046,296,00020,480
5Jul 29, 2026 06:0455,905284,098,280226,576,00047,360,00020,480
6Jul 29, 2026 06:0455,992284,572,449226,766,00047,598,00020,480
7Jul 29, 2026 06:0458,892299,665,400226,827,00061,747,00020,480
8Jul 29, 2026 06:0459,003299,974,514226,834,00062,283,00020,480
9Jul 29, 2026 06:0459,127299,936,829226,837,00062,890,00020,480