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:33M-RochatM-RochatScore: 111,252Success
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:33110,620552,879,261540,901,0001,141,0002,113,536
2May 18, 2026 01:33110,681554,024,716541,170,0001,168,0002,113,536
3May 18, 2026 01:33110,748552,504,544541,515,0001,151,0002,113,536
4May 18, 2026 01:33111,123554,070,989543,368,0001,136,0002,113,536
5May 18, 2026 01:33111,252556,258,612543,995,0001,144,0002,113,536
6May 18, 2026 01:33113,913569,440,919557,034,0001,143,0002,113,536
7May 18, 2026 01:33114,159569,363,751558,230,0001,151,0002,113,536
8May 18, 2026 01:33114,507571,637,883559,957,0001,131,0002,113,536
9May 18, 2026 01:33123,000612,161,791601,548,0001,155,0002,113,536