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 20:58anboto1anboto1Score: 57,623Success
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:0057,547290,404,745280,953,0001,029,0002,113,536
2Aug 3, 2026 21:0057,594291,234,509281,122,0001,091,0002,113,536
3Aug 3, 2026 21:0057,596291,501,015281,113,0001,112,0002,113,536
4Aug 3, 2026 21:0057,606291,252,298281,246,0001,026,0002,113,536
5Aug 3, 2026 21:0057,623290,789,708281,255,0001,098,0002,113,536
6Aug 3, 2026 21:0057,667291,763,802281,391,0001,182,0002,113,536
7Aug 3, 2026 21:0057,676291,090,806281,494,0001,122,0002,113,536
8Aug 3, 2026 21:0057,703291,902,937281,745,0001,003,0002,113,536
9Aug 3, 2026 21:0058,527295,884,417285,604,0001,180,0002,113,536