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 10:20wnwnScore: 104,978Success
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 10:22103,125514,488,757503,251,0002,064,0002,113,536
2May 11, 2026 10:22103,530516,049,010505,239,0002,061,0002,113,536
3May 11, 2026 10:22103,536516,547,756505,301,0002,026,0002,113,536
4May 11, 2026 10:22103,672516,675,554505,987,0002,008,0002,113,536
5May 11, 2026 10:22104,978524,362,531512,339,0002,055,0002,113,536
6May 11, 2026 10:22105,073525,798,624512,851,0002,009,0002,113,536
7May 11, 2026 10:22105,078524,407,633512,835,0002,049,0002,113,536
8May 11, 2026 10:22105,102524,556,326512,944,0002,059,0002,113,536
9May 11, 2026 10:22105,107523,790,935512,972,0002,054,0002,113,536