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 17, 2026 08:03M-RochatM-RochatScore: 123,090Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 08:04119,536595,414,730584,636,0001,093,0002,113,536
2May 17, 2026 08:04120,429599,586,334589,029,0001,074,0002,113,536
3May 17, 2026 08:04121,602606,785,052594,693,0001,159,0002,113,536
4May 17, 2026 08:04122,217609,575,593597,866,0001,002,0002,113,536
5May 17, 2026 08:04123,090612,068,805601,984,0001,157,0002,113,536
6May 17, 2026 08:04123,807616,266,627605,559,0001,097,0002,113,536
7May 17, 2026 08:04124,613619,500,658609,435,0001,170,0002,113,536
8May 17, 2026 08:04125,072623,002,018611,744,0001,112,0002,113,536
9May 17, 2026 08:04126,702629,710,259619,840,0001,003,0002,113,536