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 08:08wnwnScore: 110,710Success
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 08:09107,252535,961,314523,491,0002,047,0002,113,536
2May 11, 2026 08:09107,282535,366,448523,654,0002,029,0002,113,536
3May 11, 2026 08:09107,302536,056,367523,775,0002,007,0002,113,536
4May 11, 2026 08:09107,756536,817,062525,742,0002,266,0002,113,536
5May 11, 2026 08:09110,710551,275,250540,379,0002,101,0002,113,536
6May 11, 2026 08:09110,723552,333,020540,537,0002,008,0002,113,536
7May 11, 2026 08:09113,805566,772,308555,585,0002,064,0002,113,536
8May 11, 2026 08:09113,940568,870,392556,209,0002,097,0002,113,536
9May 11, 2026 08:09114,498569,809,808558,988,0002,057,0002,113,536