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 17, 2026 01:39M-RochatM-RochatScore: 122,971Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 01:40118,414590,826,987579,152,0001,080,0002,113,536
2May 17, 2026 01:40120,236598,094,145588,153,0001,006,0002,113,536
3May 17, 2026 01:40120,716600,899,140590,507,0001,003,0002,113,536
4May 17, 2026 01:40122,307609,872,817598,191,0001,116,0002,113,536
5May 17, 2026 01:40122,971611,973,295601,437,0001,123,0002,113,536
6May 17, 2026 01:40123,147614,289,088602,420,0001,003,0002,113,536
7May 17, 2026 01:40123,169614,186,383602,363,0001,166,0002,113,536
8May 17, 2026 01:40123,859616,020,733605,777,0001,134,0002,113,536
9May 17, 2026 01:40124,509619,042,357609,092,0001,004,0002,113,536