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 listMar 19, 2026 01:48Yuriy LyfenkoYuriy LyfenkoScore: 61,506Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 01:4861,361328,795,331298,671,0001,997,0002,285,568
2Mar 19, 2026 01:4861,414324,798,103297,931,0002,999,0002,514,944
3Mar 19, 2026 01:4861,422329,739,867297,971,0002,999,0002,285,568
4Mar 19, 2026 01:4861,459329,604,918298,149,0003,001,0002,285,568
5Mar 19, 2026 01:4861,506334,025,740298,385,0002,993,0002,277,376
6Mar 19, 2026 01:4861,742331,968,159299,542,0002,995,0002,506,752
7Mar 19, 2026 01:4862,353332,785,691301,538,0003,993,0002,265,088
8Mar 19, 2026 01:4862,386329,046,958303,694,0001,997,0002,519,040
9Mar 19, 2026 01:4863,624333,887,695308,763,0002,997,0002,355,200