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:43wnwnScore: 135,224Success
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:44135,131669,502,248661,141,0001,003,0002,113,536
2May 11, 2026 14:44135,137669,559,931660,169,0002,007,0002,113,536
3May 11, 2026 14:44135,155669,678,228660,257,0002,005,0002,113,536
4May 11, 2026 14:44135,190670,522,036660,362,0002,071,0002,113,536
5May 11, 2026 14:44135,224669,933,301661,597,0001,001,0002,113,536
6May 11, 2026 14:44135,785672,731,087664,348,0001,002,0002,113,536
7May 11, 2026 14:44136,516676,303,779666,917,0002,016,0002,113,536
8May 11, 2026 14:44136,517679,304,431667,933,0001,002,0002,113,536
9May 11, 2026 14:44151,727753,862,828741,451,0002,015,0002,113,536