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 11, 2026 16:09olliecrowolliecrowScore: 96,879Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 11, 2026 16:0996,857498,233,489473,602,000999,0002,281,472
2Mar 11, 2026 16:0996,859505,392,301473,612,000999,0002,281,472
3Mar 11, 2026 16:0996,861501,246,490472,621,0001,998,0002,322,432
4Mar 11, 2026 16:0996,866504,898,221472,647,0001,998,0002,281,472
5Mar 11, 2026 16:0996,879502,690,255472,709,0001,998,0002,428,928
6Mar 11, 2026 16:0996,886500,978,065472,741,0001,998,0002,281,472
7Mar 11, 2026 16:0996,892503,187,704472,772,0001,999,0002,281,472
8Mar 11, 2026 16:0996,919496,778,002473,906,000999,0002,281,472
9Mar 11, 2026 16:0996,931505,238,410472,965,0001,999,0002,334,720