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 listJun 28, 2026 00:11A_ShamanA_ShamanScore: 137,202Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 00:12137,142682,001,134669,835,0002,162,0002,113,536
2Jun 28, 2026 00:12137,165682,066,224669,890,0002,220,0002,113,536
3Jun 28, 2026 00:12137,183682,093,014670,081,0002,120,0002,113,536
4Jun 28, 2026 00:12137,198682,455,329670,079,0002,194,0002,113,536
5Jun 28, 2026 00:12137,202682,247,465670,248,0002,042,0002,113,536
6Jun 28, 2026 00:12137,245682,581,023670,394,0002,111,0002,113,536
7Jun 28, 2026 00:12137,331682,583,642670,918,0002,004,0002,113,536
8Jun 28, 2026 00:12137,339682,599,069670,785,0002,180,0002,113,536
9Jun 28, 2026 00:12137,459683,197,896671,518,0002,033,0002,113,536