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: 114,042Success
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:25110,554552,830,962540,589,0001,126,0002,113,536
2May 18, 2026 01:25111,175556,347,262543,619,0001,141,0002,113,536
3May 18, 2026 01:25111,228554,397,896543,887,0001,133,0002,113,536
4May 18, 2026 01:25112,249561,325,266548,873,0001,148,0002,113,536
5May 18, 2026 01:25114,042570,845,408557,664,0001,143,0002,113,536
6May 18, 2026 01:25114,348569,994,722559,154,0001,154,0002,113,536
7May 18, 2026 01:25114,396569,937,806559,410,0001,132,0002,113,536
8May 18, 2026 01:25114,600572,699,867560,412,0001,130,0002,113,536
9May 18, 2026 01:25114,846573,666,251559,591,0003,156,0002,113,536