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:34M-RochatM-RochatScore: 111,217Success
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:36110,604551,278,293540,815,0001,148,0002,113,536
2May 18, 2026 01:36110,677553,900,060541,160,0001,161,0002,113,536
3May 18, 2026 01:36110,856554,265,409542,028,0001,167,0002,113,536
4May 18, 2026 01:36111,051553,642,941542,990,0001,160,0002,113,536
5May 18, 2026 01:36111,217554,395,812543,815,0001,153,0002,113,536
6May 18, 2026 01:36112,923564,155,111552,156,0001,171,0002,113,536
7May 18, 2026 01:36113,904568,960,445556,943,0001,187,0002,113,536
8May 18, 2026 01:36114,496572,519,285556,818,0004,215,0002,113,536
9May 18, 2026 01:36115,985578,308,209567,186,0001,142,0002,113,536