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 14:50wnwnScore: 100,260Success
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 14:51100,226501,659,138490,105,0001,005,0002,113,536
2May 11, 2026 14:51100,236499,053,056489,150,0002,011,0002,113,536
3May 11, 2026 14:51100,237498,588,624490,158,0001,004,0002,113,536
4May 11, 2026 14:51100,250498,518,004490,221,0001,004,0002,113,536
5May 11, 2026 14:51100,260499,867,863490,272,0001,004,0002,113,536
6May 11, 2026 14:51100,319498,956,606490,560,0001,004,0002,113,536
7May 11, 2026 14:51100,336500,901,050490,645,0001,005,0002,113,536
8May 11, 2026 14:51100,497500,428,846491,435,0001,004,0002,113,536
9May 11, 2026 14:51100,893504,972,823490,356,0004,022,0002,113,536