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 listAug 3, 2026 21:17anboto1anboto1Score: 57,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 21:1857,563291,115,706280,965,0001,098,0002,113,536
2Aug 3, 2026 21:1857,606291,503,406281,187,0001,087,0002,113,536
3Aug 3, 2026 21:1857,621291,392,727281,215,0001,130,0002,113,536
4Aug 3, 2026 21:1857,721291,904,268281,695,0001,142,0002,113,536
5Aug 3, 2026 21:1857,736291,932,127281,799,0001,108,0002,113,536
6Aug 3, 2026 21:1857,909292,206,691282,660,0001,096,0002,113,536
7Aug 3, 2026 21:1858,749296,942,848286,781,0001,090,0002,113,536
8Aug 3, 2026 21:1858,915297,650,767287,590,0001,097,0002,113,536
9Aug 3, 2026 21:1859,360299,363,648289,690,0001,174,0002,113,536