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 22, 2026 20:36M-RochatM-RochatScore: 110,958Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 20:37110,541552,217,592540,508,0001,143,0002,113,536
2May 22, 2026 20:37110,541553,271,012540,489,0001,162,0002,113,536
3May 22, 2026 20:37110,594553,572,983540,776,0001,135,0002,113,536
4May 22, 2026 20:37110,609553,106,639540,852,0001,135,0002,113,536
5May 22, 2026 20:37110,958553,290,974542,570,0001,129,0002,113,536
6May 22, 2026 20:37110,993556,296,970542,725,0001,144,0002,113,536
7May 22, 2026 20:37111,008558,982,670541,737,0002,206,0002,113,536
8May 22, 2026 20:37113,727569,531,980556,131,0001,132,0002,113,536
9May 22, 2026 20:37113,838569,399,560556,656,0001,151,0002,113,536