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 17:27anboto1anboto1Score: 180,377Success
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 17:28179,689893,662,055878,250,0002,229,0002,113,536
2Jul 31, 2026 17:28179,726890,982,225877,492,0003,166,0002,113,536
3Jul 31, 2026 17:28179,736890,886,690878,539,0002,172,0002,113,536
4Jul 31, 2026 17:28179,936891,885,585879,686,0002,004,0002,113,536
5Jul 31, 2026 17:28180,377894,054,046881,842,0002,006,0002,113,536
6Jul 31, 2026 17:28180,582895,062,034882,851,0002,005,0002,113,536
7Jul 31, 2026 17:28180,642896,057,889883,070,0002,077,0002,113,536
8Jul 31, 2026 17:28180,880896,547,511884,112,0002,203,0002,113,536
9Jul 31, 2026 17:28181,213898,102,256885,810,0002,135,0002,113,536