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:24M-RochatM-RochatScore: 111,120Success
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:26110,677553,376,495541,195,0001,127,0002,113,536
2May 18, 2026 01:26110,708551,824,227541,330,0001,142,0002,113,536
3May 18, 2026 01:26110,721552,001,815541,414,0001,120,0002,113,536
4May 18, 2026 01:26110,804554,319,052541,782,0001,158,0002,113,536
5May 18, 2026 01:26111,120555,145,673543,352,0001,137,0002,113,536
6May 18, 2026 01:26111,138554,137,520543,440,0001,141,0002,113,536
7May 18, 2026 01:26111,254556,722,885544,013,0001,132,0002,113,536
8May 18, 2026 01:26114,113570,817,299557,991,0001,163,0002,113,536
9May 18, 2026 01:26121,440606,437,257593,935,0001,125,0002,113,536