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:28anboto1anboto1Score: 57,758Success
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:2957,696291,855,334281,535,0001,176,0002,113,536
2Aug 3, 2026 21:2957,709291,788,506281,674,0001,102,0002,113,536
3Aug 3, 2026 21:2957,717291,241,531281,708,0001,108,0002,113,536
4Aug 3, 2026 21:2957,736291,952,329281,840,0001,071,0002,113,536
5Aug 3, 2026 21:2957,758291,326,707281,927,0001,091,0002,113,536
6Aug 3, 2026 21:2957,768292,147,677281,949,0001,119,0002,113,536
7Aug 3, 2026 21:2957,781291,632,888282,111,0001,020,0002,113,536
8Aug 3, 2026 21:2957,828291,521,319282,251,0001,109,0002,113,536
9Aug 3, 2026 21:2957,918292,249,432282,626,0001,173,0002,113,536