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:55wnwnScore: 194,943Success
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:56190,896945,477,146934,393,0001,002,0002,113,536
2May 11, 2026 10:56191,070947,841,361935,241,0001,003,0002,113,536
3May 11, 2026 10:56191,473947,760,828936,162,0002,060,0002,113,536
4May 11, 2026 10:56191,501948,345,571936,308,0002,047,0002,113,536
5May 11, 2026 10:56194,943965,638,562954,223,0001,002,0002,113,536
6May 11, 2026 10:56200,902994,050,777983,421,0001,001,0002,113,536
7May 11, 2026 10:56200,917995,475,371982,492,0002,003,0002,113,536
8May 11, 2026 10:56201,600997,964,044985,637,0002,207,0002,113,536
9May 11, 2026 10:56298,4821,471,309,9021,460,556,0002,006,0002,113,536