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 23, 2026 12:45Dominique GarmierDominique GarmierScore: 128,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 12:45128,208657,080,053628,219,00002,383,872
2Mar 23, 2026 12:45128,210656,712,227627,231,0001,000,0002,383,872
3Mar 23, 2026 12:45128,227656,947,492627,310,0001,000,0002,281,472
4Mar 23, 2026 12:45128,252658,509,701626,437,0001,998,0002,375,680
5Mar 23, 2026 12:45128,481660,597,127627,558,0001,998,0002,392,064
6Mar 23, 2026 12:45128,493656,912,091627,620,0001,998,0002,379,776
7Mar 23, 2026 12:45128,543657,836,527628,861,000999,0002,383,872
8Mar 23, 2026 12:45128,550662,578,684627,898,0001,999,0002,281,472
9Mar 23, 2026 12:45128,592662,658,414629,100,0001,000,0002,375,680