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 listMar 10, 2026 13:27olliecrowolliecrowScore: 102,261Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 13:27102,211527,727,000498,837,0001,999,0002,281,472
2Mar 10, 2026 13:27102,214530,977,798498,848,0001,999,0002,281,472
3Mar 10, 2026 13:27102,220527,313,224498,879,0001,999,0002,273,280
4Mar 10, 2026 13:27102,230526,618,731498,926,0001,999,0002,281,472
5Mar 10, 2026 13:27102,261527,455,660500,078,0001,000,0002,326,528
6Mar 10, 2026 13:27102,547527,426,920501,481,000998,0002,449,408
7Mar 10, 2026 13:27102,548533,817,448501,485,000998,0002,281,472
8Mar 10, 2026 13:27102,555530,589,177501,521,000999,0002,281,472
9Mar 10, 2026 13:27102,639530,726,401499,932,0002,999,0002,273,280