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 15:42wnwnScore: 102,870Success
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 15:43102,740512,773,756502,422,0001,004,0002,113,536
2May 11, 2026 15:43102,797512,976,563502,701,0001,005,0002,113,536
3May 11, 2026 15:43102,815512,582,749501,775,0002,020,0002,113,536
4May 11, 2026 15:43102,841512,820,504502,919,0001,005,0002,113,536
5May 11, 2026 15:43102,870512,095,725503,059,0001,004,0002,113,536
6May 11, 2026 15:43102,901514,542,265503,213,0001,004,0002,113,536
7May 11, 2026 15:43102,904512,621,563503,227,0001,003,0002,113,536
8May 11, 2026 15:43102,915512,471,762503,281,0001,005,0002,113,536
9May 11, 2026 15:43102,919511,884,445503,299,0001,005,0002,113,536