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 27, 2026 15:09Kevin HeaveyKevin HeaveyScore: 62,717Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 15:3862,591316,696,867305,146,0001,551,00020,480
2Jul 27, 2026 15:3862,608316,770,424305,232,0001,552,00020,480
3Jul 27, 2026 15:3862,642316,971,538305,464,0001,486,0002,113,536
4Jul 27, 2026 15:3862,660317,788,862305,340,0001,696,00020,480
5Jul 27, 2026 15:3862,717317,310,785305,630,0001,684,00020,480
6Jul 27, 2026 15:3862,813318,340,895306,231,0001,556,00020,480
7Jul 27, 2026 15:3862,814318,390,343306,231,0001,562,00020,480
8Jul 27, 2026 15:3862,843317,980,138306,272,0001,663,00020,480
9Jul 27, 2026 15:3863,046319,804,819307,244,0001,683,00020,480