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 20, 2026 15:55M-RochatM-RochatScore: 110,695Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 15:56110,523553,201,323540,429,0001,134,0002,113,536
2May 20, 2026 15:56110,572553,636,253540,662,0001,142,0002,113,536
3May 20, 2026 15:56110,602554,954,042540,816,0001,137,0002,113,536
4May 20, 2026 15:56110,692552,645,701541,275,0001,119,0002,113,536
5May 20, 2026 15:56110,695554,349,234541,277,0001,130,0002,113,536
6May 20, 2026 15:56110,995554,206,670542,750,0001,128,0002,113,536
7May 20, 2026 15:56111,067554,644,631543,109,0001,124,0002,113,536
8May 20, 2026 15:56111,149555,674,540543,494,0001,138,0002,113,536
9May 20, 2026 15:56114,371572,249,679559,297,0001,122,0002,113,536