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 listMay 11, 2026 10:40wnwnScore: 98,815Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 10:4098,581491,741,291481,015,0002,032,0002,113,536
2May 11, 2026 10:4098,693505,833,905481,546,0002,050,0002,113,536
3May 11, 2026 10:4098,716494,688,414481,653,0002,058,0002,113,536
4May 11, 2026 10:4098,729492,390,100481,729,0002,044,0002,113,536
5May 11, 2026 10:4098,815495,401,244482,160,0002,038,0002,113,536
6May 11, 2026 10:4099,141495,685,476484,786,0001,005,0002,113,536
7May 11, 2026 10:4099,196494,944,605484,055,0002,008,0002,113,536
8May 11, 2026 10:4099,205497,531,284484,080,0002,029,0002,113,536
9May 11, 2026 10:4099,240495,155,253484,259,0002,021,0002,113,536