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 09:50wnwnScore: 104,674Success
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 09:51104,038520,178,266508,786,0001,003,0002,113,536
2May 11, 2026 09:51104,282521,362,590508,919,0002,066,0002,113,536
3May 11, 2026 09:51104,304519,874,492508,975,0002,119,0002,113,536
4May 11, 2026 09:51104,614521,868,352510,581,0002,032,0002,113,536
5May 11, 2026 09:51104,674521,676,742510,882,0002,024,0002,113,536
6May 11, 2026 09:51104,764522,032,259511,319,0002,026,0002,113,536
7May 11, 2026 09:51104,865524,333,230511,764,0002,075,0002,113,536
8May 11, 2026 09:51104,878524,198,451511,876,0002,028,0002,113,536
9May 11, 2026 09:51105,027527,618,514512,599,0002,034,0002,113,536