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:12M-RochatM-RochatScore: 122,957Success
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:13120,839603,925,792590,960,0001,152,0002,113,536
2May 18, 2026 01:13121,630607,109,561594,848,0001,141,0002,113,536
3May 18, 2026 01:13121,904608,403,589596,187,0001,146,0002,113,536
4May 18, 2026 01:13122,068609,499,348597,010,0001,125,0002,113,536
5May 18, 2026 01:13122,957613,770,981601,343,0001,148,0002,113,536
6May 18, 2026 01:13123,039613,040,238601,720,0001,172,0002,113,536
7May 18, 2026 01:13123,129614,256,516602,212,0001,123,0002,113,536
8May 18, 2026 01:13123,649616,096,526604,724,0001,158,0002,113,536
9May 18, 2026 01:13123,815618,100,229605,539,0001,158,0002,113,536