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 listFeb 13, 2026 17:28olliecrowolliecrowScore: 104,807Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 17:28104,709540,835,726512,076,0001,000,0002,277,376
2Feb 13, 2026 17:28104,730541,492,216512,177,0001,000,0002,330,624
3Feb 13, 2026 17:28104,764541,556,268512,345,0001,000,0002,277,376
4Feb 13, 2026 17:28104,807542,168,871513,552,00002,334,720
5Feb 13, 2026 17:28104,807544,196,354512,556,000999,0002,277,376
6Feb 13, 2026 17:28104,808539,674,233512,560,000999,0002,277,376
7Feb 13, 2026 17:28104,815545,720,048512,593,000999,0002,277,376
8Feb 13, 2026 17:28104,834539,811,445511,689,0001,998,0002,322,432
9Feb 13, 2026 17:28104,882540,225,461512,923,000999,0002,326,528