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 31, 2026 20:27anboto1anboto1Score: 160,896Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 20:28159,617792,176,710781,107,0001,018,0002,113,536
2Jul 31, 2026 20:28160,132795,382,312783,639,0001,010,0002,113,536
3Jul 31, 2026 20:28160,654797,195,529786,186,0001,020,0002,113,536
4Jul 31, 2026 20:28160,866798,452,133787,229,0001,016,0002,113,536
5Jul 31, 2026 20:28160,896798,368,372787,391,0001,002,0002,113,536
6Jul 31, 2026 20:28160,922799,198,181787,511,0001,011,0002,113,536
7Jul 31, 2026 20:28161,029799,832,725788,029,0001,014,0002,113,536
8Jul 31, 2026 20:28161,511802,152,018790,396,0001,008,0002,113,536
9Jul 31, 2026 20:28162,865808,187,947797,019,0001,021,0002,113,536