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 listJul 11, 2026 04:41RayRayScore: 1,806,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 11, 2026 04:451,714,88624,543,902,0364,182,011,0004,220,932,0002,113,536
2Jul 11, 2026 04:451,720,82825,097,602,6174,185,663,0004,246,399,0002,113,536
3Jul 11, 2026 04:451,721,64729,834,809,6354,201,331,0004,234,742,0002,113,536
4Jul 11, 2026 04:451,804,91024,335,564,8894,296,197,0004,547,862,0002,134,016
5Jul 11, 2026 04:451,806,85424,532,147,1764,307,386,0004,546,202,0002,170,880
6Jul 11, 2026 04:451,824,19525,285,324,8474,302,547,0004,636,013,0002,158,592
7Jul 11, 2026 04:451,824,26725,057,616,7574,301,441,0004,637,469,0002,170,880
8Jul 11, 2026 04:451,825,57625,158,401,7424,296,126,0004,649,197,0002,166,784
9Jul 11, 2026 04:451,831,46525,125,516,1634,302,774,0004,671,406,0002,117,632