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 17, 2026 20:57Pavel SkripkinPavel SkripkinScore: 222,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 20:57222,1711,107,357,9071,087,639,000999,0002,437,120
2Mar 17, 2026 20:57222,2911,115,088,5551,087,228,0001,998,0002,441,216
3Mar 17, 2026 20:57222,3561,127,147,9431,087,543,0001,999,0002,269,184
4Mar 17, 2026 20:57222,3781,113,426,5601,087,654,0001,999,0002,269,184
5Mar 17, 2026 20:57222,5341,115,734,2931,088,417,0001,998,0002,269,184
6Mar 17, 2026 20:57222,5491,114,347,8951,088,490,0001,999,0002,269,184
7Mar 17, 2026 20:57222,7141,121,804,2411,089,301,0001,998,0002,269,184
8Mar 17, 2026 20:57222,8411,116,320,6121,089,922,0001,999,0002,437,120
9Mar 17, 2026 20:57223,6461,121,109,5791,094,866,000999,0002,531,328