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:41olliecrowolliecrowScore: 95,123Success
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:4195,073492,357,885464,860,000999,0002,281,472
2Mar 11, 2026 16:4195,093491,175,662462,959,0002,999,0002,334,720
3Mar 11, 2026 16:4195,104491,007,715464,009,0002,000,0002,281,472
4Mar 11, 2026 16:4195,118498,620,419464,078,0002,000,0002,326,528
5Mar 11, 2026 16:4195,123487,995,325466,102,00002,281,472
6Mar 11, 2026 16:4195,126487,456,855465,115,0001,000,0002,281,472
7Mar 11, 2026 16:4195,126487,012,439465,115,0001,000,0002,281,472
8Mar 11, 2026 16:4195,129488,210,739466,130,00002,281,472
9Mar 11, 2026 16:4195,142487,313,478466,197,00002,469,888