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 25, 2026 20:56Dominique GarmierDominique GarmierScore: 407,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 16:32405,3502,009,623,7011,985,217,000999,0002,281,472
2Mar 25, 2026 16:11405,8892,008,826,1451,987,856,000999,0002,297,856
3Mar 25, 2026 16:32406,0962,017,578,8051,988,870,000999,0002,457,600
4Mar 25, 2026 16:11406,2082,019,814,5771,989,420,000999,0002,277,376
5Mar 25, 2026 16:32407,4432,020,298,6501,995,471,000999,0002,351,104
6Mar 25, 2026 16:11407,8712,023,081,5011,998,569,00002,281,472
7Mar 25, 2026 20:56426,9132,113,014,6742,090,878,000998,0002,297,856
8Mar 25, 2026 20:56428,3472,121,625,5062,097,901,000999,0002,281,472
9Mar 25, 2026 20:56434,0372,154,223,6312,123,783,0002,996,0002,285,568