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 listMay 11, 2026 11:15wnwnScore: 231,254Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 11:16228,6021,128,983,1041,119,147,0001,006,0002,113,536
2May 11, 2026 11:16228,9371,131,358,4561,120,783,0001,011,0002,113,536
3May 11, 2026 11:16229,9601,137,127,9871,125,644,0001,160,0002,113,536
4May 11, 2026 11:16230,8741,140,154,5741,130,147,0001,136,0002,113,536
5May 11, 2026 11:16231,2541,142,071,3431,132,030,0001,118,0002,113,536
6May 11, 2026 11:16231,5611,143,445,6291,133,498,0001,154,0002,113,536
7May 11, 2026 11:16231,8351,146,637,3461,134,843,0001,153,0002,113,536
8May 11, 2026 11:16231,8651,146,501,0211,134,094,0002,046,0002,113,536
9May 11, 2026 11:16232,5701,148,386,9211,138,426,0001,171,0002,113,536