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 13:59wnwnScore: 100,990Success
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 14:01100,915503,717,222493,481,0001,004,0002,113,536
2May 11, 2026 14:01100,921503,994,402493,511,0001,005,0002,113,536
3May 11, 2026 14:01100,923504,018,512493,520,0001,004,0002,113,536
4May 11, 2026 14:01100,966504,213,884493,731,0001,003,0002,113,536
5May 11, 2026 14:01100,990502,806,185493,849,0001,004,0002,113,536
6May 11, 2026 14:01101,063502,572,485493,116,0002,097,0002,113,536
7May 11, 2026 14:01101,076504,530,758494,270,0001,005,0002,113,536
8May 11, 2026 14:01101,193505,021,577494,842,0001,004,0002,113,536
9May 11, 2026 14:01101,245506,566,715493,927,0002,174,0002,113,536