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 16:20olliecrowolliecrowScore: 118,340Success
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 16:20118,281617,301,606578,576,000999,0002,285,568
2Feb 13, 2026 16:20118,284604,235,024575,595,0003,997,0002,285,568
3Feb 13, 2026 16:20118,321609,724,969577,774,0001,999,0002,285,568
4Feb 13, 2026 16:20118,336607,237,195577,847,0001,999,0002,285,568
5Feb 13, 2026 16:20118,340609,926,183577,867,0001,999,0002,494,464
6Feb 13, 2026 16:20118,341606,303,342575,870,0003,999,0002,482,176
7Feb 13, 2026 16:20118,363612,232,511575,978,0003,999,0002,285,568
8Feb 13, 2026 16:20118,371605,520,932579,016,0001,000,0002,478,080
9Feb 13, 2026 16:20118,381604,657,722579,066,0001,000,0002,285,568