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:44olliecrowolliecrowScore: 102,942Success
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:44102,777532,801,508499,610,0003,996,0002,273,280
2Feb 13, 2026 17:44102,778529,690,847500,617,0002,997,0002,326,528
3Feb 13, 2026 17:44102,796530,511,860499,702,0003,997,0002,273,280
4Feb 13, 2026 17:44102,814529,570,596501,789,0001,999,0002,322,432
5Feb 13, 2026 17:44102,942529,661,193503,416,0001,000,0002,273,280
6Feb 13, 2026 17:44102,967532,546,051502,542,0001,998,0002,273,280
7Feb 13, 2026 17:44102,988530,925,585502,643,0001,998,0002,273,280
8Feb 13, 2026 17:44102,993531,665,048503,666,000999,0002,273,280
9Feb 13, 2026 17:44103,005537,644,324502,727,0001,998,0002,322,432