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 16:05wnwnScore: 105,891Success
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 16:06105,824526,422,142517,536,0001,005,0002,113,536
2May 11, 2026 16:06105,853526,294,538517,680,0001,004,0002,113,536
3May 11, 2026 16:06105,883526,166,033517,821,0001,008,0002,113,536
4May 11, 2026 16:06105,883528,301,995517,827,0001,004,0002,113,536
5May 11, 2026 16:06105,891526,799,812517,863,0001,003,0002,113,536
6May 11, 2026 16:06105,914526,279,010517,976,0001,005,0002,113,536
7May 11, 2026 16:06106,372528,954,043520,219,0001,004,0002,113,536
8May 11, 2026 16:06106,385528,756,132520,286,0001,004,0002,113,536
9May 11, 2026 16:06106,393530,817,347520,323,0001,004,0002,113,536