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:36Yuriy LyfenkoYuriy LyfenkoScore: 71,582Success
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:3671,533378,780,660349,515,000998,0002,256,896
2Mar 19, 2026 01:3671,538376,155,868349,540,000998,0002,519,040
3Mar 19, 2026 01:3671,539374,703,377349,542,000998,0002,260,992
4Mar 19, 2026 01:3671,581380,580,079348,748,0001,998,0002,519,040
5Mar 19, 2026 01:3671,582376,266,371348,756,0001,998,0002,371,584
6Mar 19, 2026 01:3671,622378,875,317349,948,000999,0002,256,896
7Mar 19, 2026 01:3671,650373,497,368350,086,0001,000,0002,371,584
8Mar 19, 2026 01:3671,714383,794,954351,400,00002,256,896
9Mar 19, 2026 01:3671,948379,995,837351,549,000998,0002,260,992