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 18, 2026 01:09M-RochatM-RochatScore: 120,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:11119,731597,449,953585,542,0001,144,0002,113,536
2May 18, 2026 01:11120,027599,345,183586,996,0001,140,0002,113,536
3May 18, 2026 01:11120,134598,642,988587,535,0001,123,0002,113,536
4May 18, 2026 01:11120,263600,558,735588,162,0001,130,0002,113,536
5May 18, 2026 01:11120,743601,081,410590,507,0001,138,0002,113,536
6May 18, 2026 01:11121,214604,083,894592,809,0001,144,0002,113,536
7May 18, 2026 01:11121,228605,804,211592,885,0001,137,0002,113,536
8May 18, 2026 01:11122,727611,893,906600,222,0001,142,0002,113,536
9May 18, 2026 01:11123,955617,160,447606,264,0001,120,0002,113,536