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 11, 2026 07:11wnwnScore: 112,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:12111,281555,933,083542,099,0003,182,0002,113,536
2May 11, 2026 07:12111,367555,197,457542,678,0003,022,0002,113,536
3May 11, 2026 07:12112,212558,959,340546,828,0003,011,0002,113,536
4May 11, 2026 07:12112,251559,790,609546,862,0003,169,0002,113,536
5May 11, 2026 07:12112,283560,490,934547,105,0003,084,0002,113,536
6May 11, 2026 07:12112,330561,988,970547,363,0003,056,0002,113,536
7May 11, 2026 07:12112,345564,528,248547,308,0003,184,0002,113,536
8May 11, 2026 07:12112,372559,233,283547,608,0003,017,0002,113,536
9May 11, 2026 07:12112,537562,788,207548,427,0003,006,0002,113,536